/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 12:03:19,867 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 12:03:19,869 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 12:03:19,888 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 12:03:19,888 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 12:03:19,889 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 12:03:19,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 12:03:19,904 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 12:03:19,906 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 12:03:19,908 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 12:03:19,910 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 12:03:19,912 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 12:03:19,913 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 12:03:19,915 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 12:03:19,915 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 12:03:19,917 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 12:03:19,918 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 12:03:19,919 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 12:03:19,921 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 12:03:19,923 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 12:03:19,927 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 12:03:19,930 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 12:03:19,931 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 12:03:19,933 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 12:03:19,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 12:03:19,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 12:03:19,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 12:03:19,940 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 12:03:19,941 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 12:03:19,943 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 12:03:19,943 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 12:03:19,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 12:03:19,944 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 12:03:19,945 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 12:03:19,949 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 12:03:19,949 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 12:03:19,950 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 12:03:19,950 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 12:03:19,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 12:03:19,952 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 12:03:19,954 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 12:03:19,955 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 12:03:19,974 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 12:03:19,974 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 12:03:19,976 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 12:03:19,977 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 12:03:19,977 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 12:03:19,977 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 12:03:19,977 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 12:03:19,978 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 12:03:19,978 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 12:03:19,978 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 12:03:19,979 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 12:03:19,979 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 12:03:19,980 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 12:03:19,980 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 12:03:19,980 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 12:03:19,980 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 12:03:19,981 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 12:03:19,981 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 12:03:19,981 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 12:03:19,981 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 12:03:19,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 12:03:19,982 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:03:19,982 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 12:03:19,982 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 12:03:19,982 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 12:03:19,983 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 12:03:19,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 12:03:19,983 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 12:03:19,983 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 12:03:19,983 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 12:03:20,289 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 12:03:20,302 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 12:03:20,306 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 12:03:20,307 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 12:03:20,308 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 12:03:20,308 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix001_rmo.opt.i [2019-12-18 12:03:20,377 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b135c5eeb/71bb4b071e8044749f5977779b1fc489/FLAG642e4d00f [2019-12-18 12:03:20,965 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 12:03:20,968 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix001_rmo.opt.i [2019-12-18 12:03:20,991 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b135c5eeb/71bb4b071e8044749f5977779b1fc489/FLAG642e4d00f [2019-12-18 12:03:21,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b135c5eeb/71bb4b071e8044749f5977779b1fc489 [2019-12-18 12:03:21,214 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 12:03:21,216 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 12:03:21,220 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 12:03:21,220 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 12:03:21,223 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 12:03:21,224 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:03:21" (1/1) ... [2019-12-18 12:03:21,227 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6968dd54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:21, skipping insertion in model container [2019-12-18 12:03:21,228 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 12:03:21" (1/1) ... [2019-12-18 12:03:21,236 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 12:03:21,294 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 12:03:21,789 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:03:21,803 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 12:03:21,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 12:03:22,006 INFO L208 MainTranslator]: Completed translation [2019-12-18 12:03:22,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22 WrapperNode [2019-12-18 12:03:22,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 12:03:22,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 12:03:22,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 12:03:22,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 12:03:22,017 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,070 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,121 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 12:03:22,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 12:03:22,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 12:03:22,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 12:03:22,132 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,132 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,137 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,137 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,174 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,178 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... [2019-12-18 12:03:22,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 12:03:22,190 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 12:03:22,190 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 12:03:22,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 12:03:22,192 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 12:03:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 12:03:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 12:03:22,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 12:03:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 12:03:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 12:03:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 12:03:22,260 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 12:03:22,260 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 12:03:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 12:03:22,261 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 12:03:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 12:03:22,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 12:03:22,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 12:03:22,264 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 12:03:23,268 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 12:03:23,269 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 12:03:23,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:03:23 BoogieIcfgContainer [2019-12-18 12:03:23,270 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 12:03:23,271 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 12:03:23,272 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 12:03:23,275 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 12:03:23,275 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 12:03:21" (1/3) ... [2019-12-18 12:03:23,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d6189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:03:23, skipping insertion in model container [2019-12-18 12:03:23,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 12:03:22" (2/3) ... [2019-12-18 12:03:23,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f0d6189 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 12:03:23, skipping insertion in model container [2019-12-18 12:03:23,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 12:03:23" (3/3) ... [2019-12-18 12:03:23,279 INFO L109 eAbstractionObserver]: Analyzing ICFG mix001_rmo.opt.i [2019-12-18 12:03:23,289 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 12:03:23,290 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 12:03:23,298 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 12:03:23,299 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 12:03:23,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,339 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,339 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,340 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,340 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,341 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,342 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,342 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,343 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,344 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,345 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,346 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,347 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,348 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,349 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,350 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,351 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,352 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,353 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,354 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,355 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,356 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,357 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,358 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,359 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,361 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,362 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,362 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,363 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,363 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,363 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,364 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,365 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,366 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,367 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,368 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,369 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,370 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,371 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,372 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,373 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,374 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,375 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,376 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,377 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,378 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,379 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,380 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,381 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,382 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,383 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,384 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,385 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,389 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,390 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,390 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,391 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,391 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,392 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,393 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,393 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,394 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,395 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,396 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,399 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,400 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,400 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,402 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,403 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,404 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,404 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,405 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,406 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,406 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,407 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 12:03:23,423 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 12:03:23,444 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 12:03:23,445 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 12:03:23,445 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 12:03:23,445 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 12:03:23,445 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 12:03:23,445 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 12:03:23,445 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 12:03:23,446 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 12:03:23,463 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 243 transitions [2019-12-18 12:03:23,466 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 12:03:23,563 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 12:03:23,564 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:03:23,589 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 12:03:23,639 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 197 places, 243 transitions [2019-12-18 12:03:23,714 INFO L126 PetriNetUnfolder]: 56/240 cut-off events. [2019-12-18 12:03:23,715 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 12:03:23,737 INFO L76 FinitePrefix]: Finished finitePrefix Result has 250 conditions, 240 events. 56/240 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 561 event pairs. 9/191 useless extension candidates. Maximal degree in co-relation 206. Up to 2 conditions per place. [2019-12-18 12:03:23,784 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 24630 [2019-12-18 12:03:23,786 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 12:03:30,385 WARN L192 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 95 [2019-12-18 12:03:30,527 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2019-12-18 12:03:30,590 INFO L206 etLargeBlockEncoding]: Checked pairs total: 124432 [2019-12-18 12:03:30,591 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 12:03:30,594 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 130 transitions [2019-12-18 12:03:34,581 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 44886 states. [2019-12-18 12:03:34,583 INFO L276 IsEmpty]: Start isEmpty. Operand 44886 states. [2019-12-18 12:03:34,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 12:03:34,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:03:34,590 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:03:34,591 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:03:34,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:03:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash -614729650, now seen corresponding path program 1 times [2019-12-18 12:03:34,604 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:03:34,604 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734382965] [2019-12-18 12:03:34,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:03:34,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:03:34,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:03:34,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734382965] [2019-12-18 12:03:34,865 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:03:34,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:03:34,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663825381] [2019-12-18 12:03:34,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:03:34,871 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:03:34,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:03:34,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:03:34,890 INFO L87 Difference]: Start difference. First operand 44886 states. Second operand 3 states. [2019-12-18 12:03:35,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:03:35,620 INFO L93 Difference]: Finished difference Result 44562 states and 182514 transitions. [2019-12-18 12:03:35,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:03:35,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 12:03:35,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:03:36,189 INFO L225 Difference]: With dead ends: 44562 [2019-12-18 12:03:36,189 INFO L226 Difference]: Without dead ends: 41502 [2019-12-18 12:03:36,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:03:36,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41502 states. [2019-12-18 12:03:39,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41502 to 41502. [2019-12-18 12:03:39,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41502 states. [2019-12-18 12:03:40,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41502 states to 41502 states and 169862 transitions. [2019-12-18 12:03:40,238 INFO L78 Accepts]: Start accepts. Automaton has 41502 states and 169862 transitions. Word has length 7 [2019-12-18 12:03:40,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:03:40,240 INFO L462 AbstractCegarLoop]: Abstraction has 41502 states and 169862 transitions. [2019-12-18 12:03:40,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:03:40,240 INFO L276 IsEmpty]: Start isEmpty. Operand 41502 states and 169862 transitions. [2019-12-18 12:03:40,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 12:03:40,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:03:40,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:03:40,246 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:03:40,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:03:40,247 INFO L82 PathProgramCache]: Analyzing trace with hash 652997656, now seen corresponding path program 1 times [2019-12-18 12:03:40,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:03:40,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218962722] [2019-12-18 12:03:40,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:03:40,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:03:40,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:03:40,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218962722] [2019-12-18 12:03:40,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:03:40,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:03:40,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098357713] [2019-12-18 12:03:40,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:03:40,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:03:40,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:03:40,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:03:40,421 INFO L87 Difference]: Start difference. First operand 41502 states and 169862 transitions. Second operand 4 states. [2019-12-18 12:03:43,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:03:43,111 INFO L93 Difference]: Finished difference Result 66122 states and 260012 transitions. [2019-12-18 12:03:43,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:03:43,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 12:03:43,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:03:43,423 INFO L225 Difference]: With dead ends: 66122 [2019-12-18 12:03:43,424 INFO L226 Difference]: Without dead ends: 66092 [2019-12-18 12:03:43,425 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:03:44,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2019-12-18 12:03:45,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 64446. [2019-12-18 12:03:45,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64446 states. [2019-12-18 12:03:45,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64446 states to 64446 states and 254822 transitions. [2019-12-18 12:03:45,983 INFO L78 Accepts]: Start accepts. Automaton has 64446 states and 254822 transitions. Word has length 13 [2019-12-18 12:03:45,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:03:45,984 INFO L462 AbstractCegarLoop]: Abstraction has 64446 states and 254822 transitions. [2019-12-18 12:03:45,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:03:45,984 INFO L276 IsEmpty]: Start isEmpty. Operand 64446 states and 254822 transitions. [2019-12-18 12:03:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 12:03:45,990 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:03:45,991 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:03:45,991 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:03:45,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:03:45,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1079576864, now seen corresponding path program 1 times [2019-12-18 12:03:45,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:03:45,992 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379948731] [2019-12-18 12:03:45,992 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:03:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:03:46,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:03:46,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379948731] [2019-12-18 12:03:46,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:03:46,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:03:46,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869306319] [2019-12-18 12:03:46,061 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:03:46,062 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:03:46,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:03:46,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:03:46,062 INFO L87 Difference]: Start difference. First operand 64446 states and 254822 transitions. Second operand 4 states. [2019-12-18 12:03:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:03:47,237 INFO L93 Difference]: Finished difference Result 82254 states and 320688 transitions. [2019-12-18 12:03:47,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:03:47,238 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 12:03:47,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:03:47,493 INFO L225 Difference]: With dead ends: 82254 [2019-12-18 12:03:47,493 INFO L226 Difference]: Without dead ends: 82226 [2019-12-18 12:03:47,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:03:51,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82226 states. [2019-12-18 12:03:52,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82226 to 73414. [2019-12-18 12:03:52,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73414 states. [2019-12-18 12:03:52,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73414 states to 73414 states and 288912 transitions. [2019-12-18 12:03:52,695 INFO L78 Accepts]: Start accepts. Automaton has 73414 states and 288912 transitions. Word has length 16 [2019-12-18 12:03:52,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:03:52,695 INFO L462 AbstractCegarLoop]: Abstraction has 73414 states and 288912 transitions. [2019-12-18 12:03:52,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:03:52,695 INFO L276 IsEmpty]: Start isEmpty. Operand 73414 states and 288912 transitions. [2019-12-18 12:03:52,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 12:03:52,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:03:52,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 12:03:52,705 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:03:52,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:03:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash -624278653, now seen corresponding path program 1 times [2019-12-18 12:03:52,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:03:52,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961405309] [2019-12-18 12:03:52,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:03:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:03:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:03:52,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961405309] [2019-12-18 12:03:52,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:03:52,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:03:52,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598326949] [2019-12-18 12:03:52,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:03:52,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:03:52,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:03:52,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:03:52,767 INFO L87 Difference]: Start difference. First operand 73414 states and 288912 transitions. Second operand 3 states. [2019-12-18 12:03:53,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:03:53,106 INFO L93 Difference]: Finished difference Result 68874 states and 270636 transitions. [2019-12-18 12:03:53,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:03:53,107 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 12:03:53,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:03:53,275 INFO L225 Difference]: With dead ends: 68874 [2019-12-18 12:03:53,275 INFO L226 Difference]: Without dead ends: 68874 [2019-12-18 12:03:53,276 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:03:54,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68874 states. [2019-12-18 12:03:56,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68874 to 68874. [2019-12-18 12:03:56,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68874 states. [2019-12-18 12:04:00,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68874 states to 68874 states and 270636 transitions. [2019-12-18 12:04:00,704 INFO L78 Accepts]: Start accepts. Automaton has 68874 states and 270636 transitions. Word has length 18 [2019-12-18 12:04:00,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:00,704 INFO L462 AbstractCegarLoop]: Abstraction has 68874 states and 270636 transitions. [2019-12-18 12:04:00,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:04:00,704 INFO L276 IsEmpty]: Start isEmpty. Operand 68874 states and 270636 transitions. [2019-12-18 12:04:00,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 12:04:00,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:00,728 INFO L411 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] [2019-12-18 12:04:00,728 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:00,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:00,728 INFO L82 PathProgramCache]: Analyzing trace with hash -482510294, now seen corresponding path program 1 times [2019-12-18 12:04:00,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:00,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145166670] [2019-12-18 12:04:00,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:00,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:00,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:04:00,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145166670] [2019-12-18 12:04:00,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:00,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:04:00,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290040189] [2019-12-18 12:04:00,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:04:00,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:00,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:04:00,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:04:00,835 INFO L87 Difference]: Start difference. First operand 68874 states and 270636 transitions. Second operand 5 states. [2019-12-18 12:04:01,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:01,899 INFO L93 Difference]: Finished difference Result 81922 states and 317702 transitions. [2019-12-18 12:04:01,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 12:04:01,899 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-18 12:04:01,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:02,411 INFO L225 Difference]: With dead ends: 81922 [2019-12-18 12:04:02,411 INFO L226 Difference]: Without dead ends: 81870 [2019-12-18 12:04:02,412 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:04:03,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81870 states. [2019-12-18 12:04:07,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81870 to 68462. [2019-12-18 12:04:07,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68462 states. [2019-12-18 12:04:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68462 states to 68462 states and 269172 transitions. [2019-12-18 12:04:07,276 INFO L78 Accepts]: Start accepts. Automaton has 68462 states and 269172 transitions. Word has length 22 [2019-12-18 12:04:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:07,277 INFO L462 AbstractCegarLoop]: Abstraction has 68462 states and 269172 transitions. [2019-12-18 12:04:07,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:04:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 68462 states and 269172 transitions. [2019-12-18 12:04:07,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:04:07,352 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:07,352 INFO L411 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] [2019-12-18 12:04:07,352 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:07,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:07,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1940822117, now seen corresponding path program 1 times [2019-12-18 12:04:07,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:07,353 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339546467] [2019-12-18 12:04:07,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:07,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:04:07,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339546467] [2019-12-18 12:04:07,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:07,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:04:07,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248785322] [2019-12-18 12:04:07,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:04:07,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:07,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:04:07,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:04:07,463 INFO L87 Difference]: Start difference. First operand 68462 states and 269172 transitions. Second operand 5 states. [2019-12-18 12:04:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:08,475 INFO L93 Difference]: Finished difference Result 103430 states and 412650 transitions. [2019-12-18 12:04:08,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:04:08,475 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-12-18 12:04:08,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:08,722 INFO L225 Difference]: With dead ends: 103430 [2019-12-18 12:04:08,723 INFO L226 Difference]: Without dead ends: 90822 [2019-12-18 12:04:08,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:04:09,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90822 states. [2019-12-18 12:04:13,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90822 to 90822. [2019-12-18 12:04:13,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90822 states. [2019-12-18 12:04:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90822 states to 90822 states and 363292 transitions. [2019-12-18 12:04:13,929 INFO L78 Accepts]: Start accepts. Automaton has 90822 states and 363292 transitions. Word has length 32 [2019-12-18 12:04:13,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:13,930 INFO L462 AbstractCegarLoop]: Abstraction has 90822 states and 363292 transitions. [2019-12-18 12:04:13,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:04:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 90822 states and 363292 transitions. [2019-12-18 12:04:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-18 12:04:14,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:14,042 INFO L411 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] [2019-12-18 12:04:14,042 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:14,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1864942543, now seen corresponding path program 2 times [2019-12-18 12:04:14,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:14,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085482795] [2019-12-18 12:04:14,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:14,096 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:04:14,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085482795] [2019-12-18 12:04:14,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:14,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:04:14,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980168493] [2019-12-18 12:04:14,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:04:14,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:14,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:04:14,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:04:14,099 INFO L87 Difference]: Start difference. First operand 90822 states and 363292 transitions. Second operand 3 states. [2019-12-18 12:04:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:15,168 INFO L93 Difference]: Finished difference Result 90770 states and 363112 transitions. [2019-12-18 12:04:15,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:04:15,168 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-12-18 12:04:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:15,408 INFO L225 Difference]: With dead ends: 90770 [2019-12-18 12:04:15,408 INFO L226 Difference]: Without dead ends: 90770 [2019-12-18 12:04:15,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:04:16,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90770 states. [2019-12-18 12:04:22,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90770 to 90770. [2019-12-18 12:04:22,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90770 states. [2019-12-18 12:04:22,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90770 states to 90770 states and 363112 transitions. [2019-12-18 12:04:22,365 INFO L78 Accepts]: Start accepts. Automaton has 90770 states and 363112 transitions. Word has length 32 [2019-12-18 12:04:22,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:22,366 INFO L462 AbstractCegarLoop]: Abstraction has 90770 states and 363112 transitions. [2019-12-18 12:04:22,366 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:04:22,366 INFO L276 IsEmpty]: Start isEmpty. Operand 90770 states and 363112 transitions. [2019-12-18 12:04:22,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-18 12:04:22,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:22,504 INFO L411 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] [2019-12-18 12:04:22,504 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:22,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:22,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1625131118, now seen corresponding path program 1 times [2019-12-18 12:04:22,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:22,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028173992] [2019-12-18 12:04:22,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:22,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:22,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:04:22,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028173992] [2019-12-18 12:04:22,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:22,567 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 12:04:22,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952819736] [2019-12-18 12:04:22,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:04:22,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:22,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:04:22,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:04:22,568 INFO L87 Difference]: Start difference. First operand 90770 states and 363112 transitions. Second operand 3 states. [2019-12-18 12:04:23,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:23,506 INFO L93 Difference]: Finished difference Result 89976 states and 359743 transitions. [2019-12-18 12:04:23,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:04:23,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-12-18 12:04:23,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:23,743 INFO L225 Difference]: With dead ends: 89976 [2019-12-18 12:04:23,743 INFO L226 Difference]: Without dead ends: 89976 [2019-12-18 12:04:23,743 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:04:24,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89976 states. [2019-12-18 12:04:29,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89976 to 89976. [2019-12-18 12:04:29,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89976 states. [2019-12-18 12:04:29,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89976 states to 89976 states and 359743 transitions. [2019-12-18 12:04:29,467 INFO L78 Accepts]: Start accepts. Automaton has 89976 states and 359743 transitions. Word has length 33 [2019-12-18 12:04:29,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:29,467 INFO L462 AbstractCegarLoop]: Abstraction has 89976 states and 359743 transitions. [2019-12-18 12:04:29,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:04:29,468 INFO L276 IsEmpty]: Start isEmpty. Operand 89976 states and 359743 transitions. [2019-12-18 12:04:29,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:04:29,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:29,585 INFO L411 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] [2019-12-18 12:04:29,585 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:29,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:29,585 INFO L82 PathProgramCache]: Analyzing trace with hash 1074164756, now seen corresponding path program 1 times [2019-12-18 12:04:29,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:29,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914141801] [2019-12-18 12:04:29,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:29,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:29,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:04:29,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914141801] [2019-12-18 12:04:29,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:29,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:04:29,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63624844] [2019-12-18 12:04:29,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:04:29,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:29,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:04:29,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:04:29,684 INFO L87 Difference]: Start difference. First operand 89976 states and 359743 transitions. Second operand 4 states. [2019-12-18 12:04:31,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:31,445 INFO L93 Difference]: Finished difference Result 163667 states and 649420 transitions. [2019-12-18 12:04:31,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:04:31,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-18 12:04:31,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:31,903 INFO L225 Difference]: With dead ends: 163667 [2019-12-18 12:04:31,904 INFO L226 Difference]: Without dead ends: 163667 [2019-12-18 12:04:31,904 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:04:34,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163667 states. [2019-12-18 12:04:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163667 to 137507. [2019-12-18 12:04:41,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137507 states. [2019-12-18 12:04:41,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137507 states to 137507 states and 552051 transitions. [2019-12-18 12:04:41,537 INFO L78 Accepts]: Start accepts. Automaton has 137507 states and 552051 transitions. Word has length 34 [2019-12-18 12:04:41,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:41,538 INFO L462 AbstractCegarLoop]: Abstraction has 137507 states and 552051 transitions. [2019-12-18 12:04:41,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:04:41,538 INFO L276 IsEmpty]: Start isEmpty. Operand 137507 states and 552051 transitions. [2019-12-18 12:04:41,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 12:04:41,719 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:41,719 INFO L411 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] [2019-12-18 12:04:41,720 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:41,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:41,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1626828954, now seen corresponding path program 2 times [2019-12-18 12:04:41,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:41,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132995321] [2019-12-18 12:04:41,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:41,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:41,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:04:41,789 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132995321] [2019-12-18 12:04:41,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:41,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 12:04:41,790 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988909893] [2019-12-18 12:04:41,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 12:04:41,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:41,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 12:04:41,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:04:41,792 INFO L87 Difference]: Start difference. First operand 137507 states and 552051 transitions. Second operand 3 states. [2019-12-18 12:04:43,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:04:43,332 INFO L93 Difference]: Finished difference Result 136839 states and 540867 transitions. [2019-12-18 12:04:43,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 12:04:43,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-18 12:04:43,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:04:43,698 INFO L225 Difference]: With dead ends: 136839 [2019-12-18 12:04:43,699 INFO L226 Difference]: Without dead ends: 136839 [2019-12-18 12:04:43,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 12:04:45,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136839 states. [2019-12-18 12:04:52,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136839 to 136551. [2019-12-18 12:04:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136551 states. [2019-12-18 12:04:53,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136551 states to 136551 states and 539951 transitions. [2019-12-18 12:04:53,927 INFO L78 Accepts]: Start accepts. Automaton has 136551 states and 539951 transitions. Word has length 34 [2019-12-18 12:04:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:04:53,927 INFO L462 AbstractCegarLoop]: Abstraction has 136551 states and 539951 transitions. [2019-12-18 12:04:53,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 12:04:53,927 INFO L276 IsEmpty]: Start isEmpty. Operand 136551 states and 539951 transitions. [2019-12-18 12:04:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 12:04:54,119 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:04:54,119 INFO L411 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] [2019-12-18 12:04:54,119 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:04:54,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:04:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1505027812, now seen corresponding path program 1 times [2019-12-18 12:04:54,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:04:54,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295934046] [2019-12-18 12:04:54,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:04:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:04:54,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:04:54,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295934046] [2019-12-18 12:04:54,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:04:54,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:04:54,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727293250] [2019-12-18 12:04:54,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:04:54,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:04:54,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:04:54,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:04:54,459 INFO L87 Difference]: Start difference. First operand 136551 states and 539951 transitions. Second operand 12 states. [2019-12-18 12:05:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:03,229 INFO L93 Difference]: Finished difference Result 263001 states and 1048950 transitions. [2019-12-18 12:05:03,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 12:05:03,229 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-18 12:05:03,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:04,576 INFO L225 Difference]: With dead ends: 263001 [2019-12-18 12:05:04,577 INFO L226 Difference]: Without dead ends: 234237 [2019-12-18 12:05:04,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=170, Invalid=700, Unknown=0, NotChecked=0, Total=870 [2019-12-18 12:05:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234237 states. [2019-12-18 12:05:09,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234237 to 157013. [2019-12-18 12:05:09,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157013 states. [2019-12-18 12:05:10,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157013 states to 157013 states and 623822 transitions. [2019-12-18 12:05:10,137 INFO L78 Accepts]: Start accepts. Automaton has 157013 states and 623822 transitions. Word has length 35 [2019-12-18 12:05:10,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:10,138 INFO L462 AbstractCegarLoop]: Abstraction has 157013 states and 623822 transitions. [2019-12-18 12:05:10,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:05:10,138 INFO L276 IsEmpty]: Start isEmpty. Operand 157013 states and 623822 transitions. [2019-12-18 12:05:10,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 12:05:10,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:10,371 INFO L411 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] [2019-12-18 12:05:10,371 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:10,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:10,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1552206282, now seen corresponding path program 2 times [2019-12-18 12:05:10,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:10,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683946409] [2019-12-18 12:05:10,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:10,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:05:12,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683946409] [2019-12-18 12:05:12,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:12,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 12:05:12,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314219478] [2019-12-18 12:05:12,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 12:05:12,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:12,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 12:05:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 12:05:12,092 INFO L87 Difference]: Start difference. First operand 157013 states and 623822 transitions. Second operand 12 states. [2019-12-18 12:05:22,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:22,070 INFO L93 Difference]: Finished difference Result 243926 states and 963428 transitions. [2019-12-18 12:05:22,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-18 12:05:22,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2019-12-18 12:05:22,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:22,698 INFO L225 Difference]: With dead ends: 243926 [2019-12-18 12:05:22,698 INFO L226 Difference]: Without dead ends: 224492 [2019-12-18 12:05:22,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=161, Invalid=651, Unknown=0, NotChecked=0, Total=812 [2019-12-18 12:05:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224492 states. [2019-12-18 12:05:28,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224492 to 160321. [2019-12-18 12:05:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160321 states. [2019-12-18 12:05:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160321 states to 160321 states and 637312 transitions. [2019-12-18 12:05:28,713 INFO L78 Accepts]: Start accepts. Automaton has 160321 states and 637312 transitions. Word has length 35 [2019-12-18 12:05:28,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:28,713 INFO L462 AbstractCegarLoop]: Abstraction has 160321 states and 637312 transitions. [2019-12-18 12:05:28,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 12:05:28,713 INFO L276 IsEmpty]: Start isEmpty. Operand 160321 states and 637312 transitions. [2019-12-18 12:05:28,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-18 12:05:28,956 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:28,957 INFO L411 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] [2019-12-18 12:05:28,957 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:28,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:28,957 INFO L82 PathProgramCache]: Analyzing trace with hash -1314907440, now seen corresponding path program 3 times [2019-12-18 12:05:28,957 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:28,957 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748872036] [2019-12-18 12:05:28,957 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:29,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:05:29,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748872036] [2019-12-18 12:05:29,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:29,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 12:05:29,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925505774] [2019-12-18 12:05:29,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 12:05:29,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:29,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 12:05:29,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:05:29,018 INFO L87 Difference]: Start difference. First operand 160321 states and 637312 transitions. Second operand 5 states. [2019-12-18 12:05:29,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:29,162 INFO L93 Difference]: Finished difference Result 21051 states and 72404 transitions. [2019-12-18 12:05:29,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 12:05:29,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-12-18 12:05:29,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:29,183 INFO L225 Difference]: With dead ends: 21051 [2019-12-18 12:05:29,183 INFO L226 Difference]: Without dead ends: 11545 [2019-12-18 12:05:29,183 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-18 12:05:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11545 states. [2019-12-18 12:05:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11545 to 11509. [2019-12-18 12:05:29,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11509 states. [2019-12-18 12:05:29,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11509 states to 11509 states and 33843 transitions. [2019-12-18 12:05:29,332 INFO L78 Accepts]: Start accepts. Automaton has 11509 states and 33843 transitions. Word has length 35 [2019-12-18 12:05:29,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:29,332 INFO L462 AbstractCegarLoop]: Abstraction has 11509 states and 33843 transitions. [2019-12-18 12:05:29,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 12:05:29,333 INFO L276 IsEmpty]: Start isEmpty. Operand 11509 states and 33843 transitions. [2019-12-18 12:05:29,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:05:29,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:29,346 INFO L411 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] [2019-12-18 12:05:29,346 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:29,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:29,346 INFO L82 PathProgramCache]: Analyzing trace with hash -492468280, now seen corresponding path program 1 times [2019-12-18 12:05:29,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:29,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326778045] [2019-12-18 12:05:29,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:29,411 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:05:29,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326778045] [2019-12-18 12:05:29,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:29,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:05:29,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482317874] [2019-12-18 12:05:29,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:05:29,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:29,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:05:29,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:05:29,413 INFO L87 Difference]: Start difference. First operand 11509 states and 33843 transitions. Second operand 4 states. [2019-12-18 12:05:29,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:29,477 INFO L93 Difference]: Finished difference Result 12692 states and 36561 transitions. [2019-12-18 12:05:29,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:05:29,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 12:05:29,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:29,499 INFO L225 Difference]: With dead ends: 12692 [2019-12-18 12:05:29,500 INFO L226 Difference]: Without dead ends: 11513 [2019-12-18 12:05:29,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:05:29,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11513 states. [2019-12-18 12:05:31,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11513 to 11133. [2019-12-18 12:05:31,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11133 states. [2019-12-18 12:05:31,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11133 states to 11133 states and 32986 transitions. [2019-12-18 12:05:31,256 INFO L78 Accepts]: Start accepts. Automaton has 11133 states and 32986 transitions. Word has length 47 [2019-12-18 12:05:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:31,256 INFO L462 AbstractCegarLoop]: Abstraction has 11133 states and 32986 transitions. [2019-12-18 12:05:31,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:05:31,257 INFO L276 IsEmpty]: Start isEmpty. Operand 11133 states and 32986 transitions. [2019-12-18 12:05:31,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:05:31,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:31,278 INFO L411 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] [2019-12-18 12:05:31,278 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:31,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:31,279 INFO L82 PathProgramCache]: Analyzing trace with hash -109708298, now seen corresponding path program 2 times [2019-12-18 12:05:31,279 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:31,279 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455718156] [2019-12-18 12:05:31,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:31,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:05:31,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455718156] [2019-12-18 12:05:31,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:31,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 12:05:31,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537744022] [2019-12-18 12:05:31,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 12:05:31,361 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:31,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 12:05:31,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 12:05:31,362 INFO L87 Difference]: Start difference. First operand 11133 states and 32986 transitions. Second operand 4 states. [2019-12-18 12:05:31,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:31,447 INFO L93 Difference]: Finished difference Result 17030 states and 47873 transitions. [2019-12-18 12:05:31,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 12:05:31,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-12-18 12:05:31,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:31,459 INFO L225 Difference]: With dead ends: 17030 [2019-12-18 12:05:31,459 INFO L226 Difference]: Without dead ends: 6173 [2019-12-18 12:05:31,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 12:05:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6173 states. [2019-12-18 12:05:31,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6173 to 6170. [2019-12-18 12:05:31,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6170 states. [2019-12-18 12:05:31,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6170 states to 6170 states and 15504 transitions. [2019-12-18 12:05:31,564 INFO L78 Accepts]: Start accepts. Automaton has 6170 states and 15504 transitions. Word has length 47 [2019-12-18 12:05:31,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:31,564 INFO L462 AbstractCegarLoop]: Abstraction has 6170 states and 15504 transitions. [2019-12-18 12:05:31,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 12:05:31,564 INFO L276 IsEmpty]: Start isEmpty. Operand 6170 states and 15504 transitions. [2019-12-18 12:05:31,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-18 12:05:31,571 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:31,572 INFO L411 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] [2019-12-18 12:05:31,572 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:31,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:31,572 INFO L82 PathProgramCache]: Analyzing trace with hash 924019022, now seen corresponding path program 3 times [2019-12-18 12:05:31,572 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:31,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655455397] [2019-12-18 12:05:31,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:31,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:05:31,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655455397] [2019-12-18 12:05:31,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:31,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 12:05:31,686 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729048997] [2019-12-18 12:05:31,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 12:05:31,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:31,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 12:05:31,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-18 12:05:31,687 INFO L87 Difference]: Start difference. First operand 6170 states and 15504 transitions. Second operand 6 states. [2019-12-18 12:05:31,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:31,768 INFO L93 Difference]: Finished difference Result 4632 states and 11948 transitions. [2019-12-18 12:05:31,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 12:05:31,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2019-12-18 12:05:31,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:31,769 INFO L225 Difference]: With dead ends: 4632 [2019-12-18 12:05:31,769 INFO L226 Difference]: Without dead ends: 502 [2019-12-18 12:05:31,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 12:05:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-12-18 12:05:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 502. [2019-12-18 12:05:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2019-12-18 12:05:31,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 1116 transitions. [2019-12-18 12:05:31,778 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 1116 transitions. Word has length 47 [2019-12-18 12:05:31,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:31,779 INFO L462 AbstractCegarLoop]: Abstraction has 502 states and 1116 transitions. [2019-12-18 12:05:31,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 12:05:31,779 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 1116 transitions. [2019-12-18 12:05:31,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:05:31,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:31,780 INFO L411 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] [2019-12-18 12:05:31,780 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:31,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:31,780 INFO L82 PathProgramCache]: Analyzing trace with hash -496292372, now seen corresponding path program 1 times [2019-12-18 12:05:31,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:31,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896129442] [2019-12-18 12:05:31,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 12:05:31,868 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 12:05:31,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896129442] [2019-12-18 12:05:31,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 12:05:31,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 12:05:31,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342040148] [2019-12-18 12:05:31,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 12:05:31,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 12:05:31,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 12:05:31,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-18 12:05:31,871 INFO L87 Difference]: Start difference. First operand 502 states and 1116 transitions. Second operand 8 states. [2019-12-18 12:05:32,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 12:05:32,096 INFO L93 Difference]: Finished difference Result 1040 states and 2253 transitions. [2019-12-18 12:05:32,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 12:05:32,096 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 63 [2019-12-18 12:05:32,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 12:05:32,098 INFO L225 Difference]: With dead ends: 1040 [2019-12-18 12:05:32,098 INFO L226 Difference]: Without dead ends: 789 [2019-12-18 12:05:32,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-18 12:05:32,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-18 12:05:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 625. [2019-12-18 12:05:32,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 625 states. [2019-12-18 12:05:32,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 625 states and 1348 transitions. [2019-12-18 12:05:32,106 INFO L78 Accepts]: Start accepts. Automaton has 625 states and 1348 transitions. Word has length 63 [2019-12-18 12:05:32,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 12:05:32,106 INFO L462 AbstractCegarLoop]: Abstraction has 625 states and 1348 transitions. [2019-12-18 12:05:32,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 12:05:32,106 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 1348 transitions. [2019-12-18 12:05:32,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-18 12:05:32,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 12:05:32,107 INFO L411 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] [2019-12-18 12:05:32,108 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 12:05:32,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 12:05:32,108 INFO L82 PathProgramCache]: Analyzing trace with hash -2092088660, now seen corresponding path program 2 times [2019-12-18 12:05:32,108 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 12:05:32,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197315086] [2019-12-18 12:05:32,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 12:05:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:05:32,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 12:05:32,251 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 12:05:32,251 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 12:05:32,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1028] [1028] ULTIMATE.startENTRY-->L840: Formula: (let ((.cse0 (store |v_#valid_146| 0 0))) (and (= v_~y$w_buff0_used~0_977 0) (= v_~main$tmp_guard0~0_31 0) (= v_~__unbuffered_cnt~0_147 0) (= v_~y~0_394 0) (= 0 v_~y$read_delayed_var~0.offset_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t29~0.base_112|) (= v_~z~0_33 0) (= 0 v_~weak$$choice0~0_268) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t29~0.base_112|)) (= v_~y$w_buff1~0_277 0) (= 0 v_~y$r_buff1_thd3~0_407) (= v_~y$read_delayed~0_7 0) (= v_~x~0_53 0) (= v_~y$w_buff1_used~0_557 0) (= 0 v_~__unbuffered_p0_EAX~0_92) (= v_~y$r_buff1_thd0~0_349 0) (= v_~__unbuffered_p0_EBX~0_92 0) (= v_~y$mem_tmp~0_281 0) (= v_~weak$$choice2~0_344 0) (= v_~y$r_buff0_thd0~0_222 0) (= 0 |v_ULTIMATE.start_main_~#t29~0.offset_63|) (= 0 v_~y$r_buff1_thd2~0_454) (< 0 |v_#StackHeapBarrier_18|) (= v_~main$tmp_guard1~0_83 0) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$w_buff0~0_387) (= |v_#NULL.offset_5| 0) (= 0 v_~y$r_buff0_thd2~0_461) (= v_~y$r_buff0_thd1~0_167 0) (= 0 v_~__unbuffered_p1_EBX~0_100) (= 0 v_~y$r_buff0_thd3~0_651) (= v_~__unbuffered_p2_EBX~0_91 0) (= v_~__unbuffered_p1_EAX~0_110 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t29~0.base_112| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t29~0.base_112|) |v_ULTIMATE.start_main_~#t29~0.offset_63| 0)) |v_#memory_int_21|) (= v_~y$r_buff1_thd1~0_236 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t29~0.base_112| 4) |v_#length_25|) (= 0 |v_#NULL.base_5|) (= 0 v_~__unbuffered_p2_EAX~0_98) (= (store .cse0 |v_ULTIMATE.start_main_~#t29~0.base_112| 1) |v_#valid_144|) (= v_~y$flush_delayed~0_345 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_146|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet57=|v_ULTIMATE.start_main_#t~nondet57_18|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_10|, ULTIMATE.start_main_~#t31~0.base=|v_ULTIMATE.start_main_~#t31~0.base_59|, #NULL.offset=|v_#NULL.offset_5|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$mem_tmp~0=v_~y$mem_tmp~0_281, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_92, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_407, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_110, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_167, ~y$flush_delayed~0=v_~y$flush_delayed~0_345, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_98, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_91, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_92, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_57|, ULTIMATE.start_main_~#t30~0.offset=|v_ULTIMATE.start_main_~#t30~0.offset_36|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_167|, ~weak$$choice0~0=v_~weak$$choice0~0_268, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_33|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_~#t29~0.base=|v_ULTIMATE.start_main_~#t29~0.base_112|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_461, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147, ULTIMATE.start_main_~#t30~0.base=|v_ULTIMATE.start_main_~#t30~0.base_84|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_349, ~x~0=v_~x~0_53, ULTIMATE.start_main_~#t29~0.offset=|v_ULTIMATE.start_main_~#t29~0.offset_63|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_977, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_10|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_83, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_236, ULTIMATE.start_main_~#t31~0.offset=|v_ULTIMATE.start_main_~#t31~0.offset_36|, ~y$w_buff0~0=v_~y$w_buff0~0_387, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_651, ~y~0=v_~y~0_394, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_100, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_84|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_29|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_454, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_375|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_67|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_222, #valid=|v_#valid_144|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_344, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet57, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_~#t31~0.base, #NULL.offset, ~y$read_delayed~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_~#t30~0.offset, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t29~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t30~0.base, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t29~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet56, ~main$tmp_guard1~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t31~0.offset, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:05:32,257 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L840-1-->L842: Formula: (and (not (= |v_ULTIMATE.start_main_~#t30~0.base_11| 0)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t30~0.base_11| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t30~0.base_11|) |v_ULTIMATE.start_main_~#t30~0.offset_10| 1)) |v_#memory_int_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t30~0.base_11|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t30~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t30~0.base_11|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t30~0.base_11| 1) |v_#valid_32|) (= |v_ULTIMATE.start_main_~#t30~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t30~0.offset=|v_ULTIMATE.start_main_~#t30~0.offset_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t30~0.base=|v_ULTIMATE.start_main_~#t30~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, ULTIMATE.start_main_~#t30~0.offset, #length, ULTIMATE.start_main_~#t30~0.base] because there is no mapped edge [2019-12-18 12:05:32,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L842-1-->L844: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t31~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t31~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t31~0.base_11|) |v_ULTIMATE.start_main_~#t31~0.offset_10| 2)) |v_#memory_int_13|) (= (select |v_#valid_35| |v_ULTIMATE.start_main_~#t31~0.base_11|) 0) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t31~0.base_11| 1)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t31~0.base_11|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t31~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t31~0.offset_10| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t31~0.base=|v_ULTIMATE.start_main_~#t31~0.base_11|, ULTIMATE.start_main_~#t31~0.offset=|v_ULTIMATE.start_main_~#t31~0.offset_10|, #valid=|v_#valid_34|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_6|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t31~0.base, ULTIMATE.start_main_~#t31~0.offset, #valid, ULTIMATE.start_main_#t~nondet56, #memory_int, #length] because there is no mapped edge [2019-12-18 12:05:32,259 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [927] [927] P2ENTRY-->L4-3: Formula: (and (= v_~y$w_buff0_used~0_346 v_~y$w_buff1_used~0_197) (= v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|) (= |v_P2Thread1of1ForFork0_#in~arg.offset_69| v_P2Thread1of1ForFork0_~arg.offset_69) (= |v_P2Thread1of1ForFork0_#in~arg.base_69| v_P2Thread1of1ForFork0_~arg.base_69) (= (mod v_~y$w_buff1_used~0_197 256) 0) (= v_~y$w_buff1~0_94 v_~y$w_buff0~0_159) (= v_~y$w_buff0_used~0_345 1) (= 1 v_~y$w_buff0~0_158) (= 1 |v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|)) InVars {P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_346, ~y$w_buff0~0=v_~y$w_buff0~0_159, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|} OutVars{P2Thread1of1ForFork0_~arg.base=v_P2Thread1of1ForFork0_~arg.base_69, P2Thread1of1ForFork0_#in~arg.offset=|v_P2Thread1of1ForFork0_#in~arg.offset_69|, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P2Thread1of1ForFork0___VERIFIER_assert_#in~expression_69|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff1~0=v_~y$w_buff1~0_94, ~y$w_buff0~0=v_~y$w_buff0~0_158, P2Thread1of1ForFork0_~arg.offset=v_P2Thread1of1ForFork0_~arg.offset_69, P2Thread1of1ForFork0_#in~arg.base=|v_P2Thread1of1ForFork0_#in~arg.base_69|, P2Thread1of1ForFork0___VERIFIER_assert_~expression=v_P2Thread1of1ForFork0___VERIFIER_assert_~expression_71, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_197} AuxVars[] AssignedVars[P2Thread1of1ForFork0_~arg.base, P2Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P2Thread1of1ForFork0_~arg.offset, P2Thread1of1ForFork0___VERIFIER_assert_~expression, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 12:05:32,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [968] [968] L802-2-->L802-4: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1170594396 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1170594396 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite28_Out1170594396| ~y$w_buff1~0_In1170594396) (or .cse0 .cse1)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite28_Out1170594396| ~y$w_buff0~0_In1170594396) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1170594396, ~y$w_buff1~0=~y$w_buff1~0_In1170594396, ~y$w_buff0~0=~y$w_buff0~0_In1170594396, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1170594396} OutVars{P2Thread1of1ForFork0_#t~ite28=|P2Thread1of1ForFork0_#t~ite28_Out1170594396|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1170594396, ~y$w_buff1~0=~y$w_buff1~0_In1170594396, ~y$w_buff0~0=~y$w_buff0~0_In1170594396, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1170594396} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 12:05:32,261 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [883] [883] L802-4-->L803: Formula: (= v_~y~0_30 |v_P2Thread1of1ForFork0_#t~ite28_8|) InVars {P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_8|} OutVars{P2Thread1of1ForFork0_#t~ite28=|v_P2Thread1of1ForFork0_#t~ite28_7|, P2Thread1of1ForFork0_#t~ite29=|v_P2Thread1of1ForFork0_#t~ite29_7|, ~y~0=v_~y~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite28, P2Thread1of1ForFork0_#t~ite29, ~y~0] because there is no mapped edge [2019-12-18 12:05:32,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L807-->L808: Formula: (and (= v_~y$r_buff0_thd3~0_64 v_~y$r_buff0_thd3~0_63) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_64, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{P2Thread1of1ForFork0_#t~ite44=|v_P2Thread1of1ForFork0_#t~ite44_9|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_63, P2Thread1of1ForFork0_#t~ite42=|v_P2Thread1of1ForFork0_#t~ite42_7|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite44, P2Thread1of1ForFork0_#t~ite43, ~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-18 12:05:32,270 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-709495766 256) 0))) (or (and .cse0 (= ~y~0_In-709495766 |P2Thread1of1ForFork0_#t~ite48_Out-709495766|)) (and (not .cse0) (= ~y$mem_tmp~0_In-709495766 |P2Thread1of1ForFork0_#t~ite48_Out-709495766|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-709495766, ~y$flush_delayed~0=~y$flush_delayed~0_In-709495766, ~y~0=~y~0_In-709495766} OutVars{P2Thread1of1ForFork0_#t~ite48=|P2Thread1of1ForFork0_#t~ite48_Out-709495766|, ~y$mem_tmp~0=~y$mem_tmp~0_In-709495766, ~y$flush_delayed~0=~y$flush_delayed~0_In-709495766, ~y~0=~y~0_In-709495766} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite48] because there is no mapped edge [2019-12-18 12:05:32,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] P0ENTRY-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork1_#in~arg.base_10| v_P0Thread1of1ForFork1_~arg.base_10) (= v_~z~0_13 v_~__unbuffered_p0_EAX~0_17) (= (+ v_~__unbuffered_cnt~0_80 1) v_~__unbuffered_cnt~0_79) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~__unbuffered_p0_EBX~0_17 v_~x~0_35) (= v_~z~0_13 1) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= v_P0Thread1of1ForFork1_~arg.offset_10 |v_P0Thread1of1ForFork1_#in~arg.offset_10|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_80, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_10|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_79, ~z~0=v_~z~0_13, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_10|, ~x~0=v_~x~0_35, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_10} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, ~z~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-18 12:05:32,274 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In1465450690 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1465450690 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite51_Out1465450690| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite51_Out1465450690| ~y$w_buff0_used~0_In1465450690)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1465450690, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1465450690} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1465450690, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1465450690, P2Thread1of1ForFork0_#t~ite51=|P2Thread1of1ForFork0_#t~ite51_Out1465450690|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite51] because there is no mapped edge [2019-12-18 12:05:32,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [953] [953] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1255287435 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In-1255287435 256))) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-1255287435 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1255287435 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite52_Out-1255287435| ~y$w_buff1_used~0_In-1255287435) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite52_Out-1255287435|) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1255287435, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1255287435, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1255287435, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1255287435} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1255287435, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1255287435, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1255287435, P2Thread1of1ForFork0_#t~ite52=|P2Thread1of1ForFork0_#t~ite52_Out-1255287435|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1255287435} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite52] because there is no mapped edge [2019-12-18 12:05:32,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [961] [961] L820-->L821: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In551571926 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd3~0_In551571926 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd3~0_In551571926 ~y$r_buff0_thd3~0_Out551571926)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd3~0_Out551571926 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In551571926, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In551571926} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In551571926, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out551571926, P2Thread1of1ForFork0_#t~ite53=|P2Thread1of1ForFork0_#t~ite53_Out551571926|} AuxVars[] AssignedVars[~y$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite53] because there is no mapped edge [2019-12-18 12:05:32,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L821-->L821-2: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd3~0_In650517990 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In650517990 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In650517990 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In650517990 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In650517990 |P2Thread1of1ForFork0_#t~ite54_Out650517990|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork0_#t~ite54_Out650517990| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In650517990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650517990, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In650517990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650517990} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In650517990, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650517990, P2Thread1of1ForFork0_#t~ite54=|P2Thread1of1ForFork0_#t~ite54_Out650517990|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In650517990, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650517990} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-18 12:05:32,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L821-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd3~0_196 |v_P2Thread1of1ForFork0_#t~ite54_38|) (= (+ v_~__unbuffered_cnt~0_98 1) v_~__unbuffered_cnt~0_97) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_38|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_196, P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite54=|v_P2Thread1of1ForFork0_#t~ite54_37|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite54, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-18 12:05:32,289 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L773-->L773-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In798562508 256)))) (or (and (= ~y~0_In798562508 |P1Thread1of1ForFork2_#t~ite25_Out798562508|) .cse0) (and (= |P1Thread1of1ForFork2_#t~ite25_Out798562508| ~y$mem_tmp~0_In798562508) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In798562508, ~y$flush_delayed~0=~y$flush_delayed~0_In798562508, ~y~0=~y~0_In798562508} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In798562508, ~y$flush_delayed~0=~y$flush_delayed~0_In798562508, ~y~0=~y~0_In798562508, P1Thread1of1ForFork2_#t~ite25=|P1Thread1of1ForFork2_#t~ite25_Out798562508|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 12:05:32,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L773-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~y$flush_delayed~0_261 0) (= v_~y~0_233 |v_P1Thread1of1ForFork2_#t~ite25_94|) (= v_~__unbuffered_cnt~0_123 (+ v_~__unbuffered_cnt~0_124 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_124, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_94|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_261, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_123, ~y~0=v_~y~0_233, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_93|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#res.base, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-18 12:05:32,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [898] [898] L848-->L850-2: Formula: (and (or (= (mod v_~y$r_buff0_thd0~0_26 256) 0) (= (mod v_~y$w_buff0_used~0_150 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_150, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_26, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 12:05:32,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [947] [947] L850-2-->L850-5: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2138333884 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2138333884 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite58_Out-2138333884| |ULTIMATE.start_main_#t~ite59_Out-2138333884|))) (or (and (= ~y$w_buff1~0_In-2138333884 |ULTIMATE.start_main_#t~ite58_Out-2138333884|) (not .cse0) (not .cse1) .cse2) (and (= |ULTIMATE.start_main_#t~ite58_Out-2138333884| ~y~0_In-2138333884) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-2138333884, ~y~0=~y~0_In-2138333884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2138333884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2138333884} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-2138333884, ULTIMATE.start_main_#t~ite58=|ULTIMATE.start_main_#t~ite58_Out-2138333884|, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out-2138333884|, ~y~0=~y~0_In-2138333884, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2138333884, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2138333884} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-18 12:05:32,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L851-->L851-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-1002527888 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1002527888 256)))) (or (and (= ~y$w_buff0_used~0_In-1002527888 |ULTIMATE.start_main_#t~ite60_Out-1002527888|) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite60_Out-1002527888| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1002527888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1002527888} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-1002527888|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1002527888, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1002527888} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-18 12:05:32,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L852-->L852-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1749578732 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1749578732 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1749578732 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-1749578732 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite61_Out-1749578732| ~y$w_buff1_used~0_In-1749578732)) (and (= |ULTIMATE.start_main_#t~ite61_Out-1749578732| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749578732, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1749578732, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1749578732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749578732} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out-1749578732|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1749578732, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1749578732, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1749578732, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1749578732} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-18 12:05:32,295 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [970] [970] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd0~0_In-500360585 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-500360585 256) 0))) (or (and (= ~y$r_buff0_thd0~0_In-500360585 |ULTIMATE.start_main_#t~ite62_Out-500360585|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite62_Out-500360585|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-500360585, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-500360585} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-500360585|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-500360585, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-500360585} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-18 12:05:32,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [951] [951] L854-->L854-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In1031046913 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1031046913 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1031046913 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1031046913 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite63_Out1031046913| ~y$r_buff1_thd0~0_In1031046913)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |ULTIMATE.start_main_#t~ite63_Out1031046913| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1031046913, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1031046913, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1031046913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1031046913} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1031046913|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1031046913, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1031046913, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1031046913, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1031046913} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-18 12:05:32,297 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L854-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p1_EBX~0_29 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_18 0) (= v_~y$r_buff1_thd0~0_254 |v_ULTIMATE.start_main_#t~ite63_47|) (= 1 v_~__unbuffered_p0_EAX~0_29) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_22 256)) (= 1 v_~__unbuffered_p1_EAX~0_47) (= v_~__unbuffered_p2_EBX~0_26 0) (= v_~__unbuffered_p0_EBX~0_29 0) (= v_~main$tmp_guard1~0_22 0) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_47|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_46|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_29, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_18, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_29, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_29, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_26, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_47, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_254, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 12:05:32,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 12:05:32 BasicIcfg [2019-12-18 12:05:32,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 12:05:32,440 INFO L168 Benchmark]: Toolchain (without parser) took 131221.97 ms. Allocated memory was 147.8 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 102.8 MB in the beginning and 2.6 GB in the end (delta: -2.5 GB). Peak memory consumption was 463.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:32,441 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 12:05:32,447 INFO L168 Benchmark]: CACSL2BoogieTranslator took 788.14 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 102.6 MB in the beginning and 157.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:32,448 INFO L168 Benchmark]: Boogie Procedure Inliner took 112.96 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:32,449 INFO L168 Benchmark]: Boogie Preprocessor took 68.38 ms. Allocated memory is still 204.5 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:32,453 INFO L168 Benchmark]: RCFGBuilder took 1080.53 ms. Allocated memory was 204.5 MB in the beginning and 232.8 MB in the end (delta: 28.3 MB). Free memory was 152.1 MB in the beginning and 203.8 MB in the end (delta: -51.6 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:32,454 INFO L168 Benchmark]: TraceAbstraction took 129164.05 ms. Allocated memory was 232.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 203.8 MB in the beginning and 2.6 GB in the end (delta: -2.4 GB). Peak memory consumption was 479.9 MB. Max. memory is 7.1 GB. [2019-12-18 12:05:32,462 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 147.8 MB. Free memory was 122.9 MB in the beginning and 122.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 788.14 ms. Allocated memory was 147.8 MB in the beginning and 204.5 MB in the end (delta: 56.6 MB). Free memory was 102.6 MB in the beginning and 157.8 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 112.96 ms. Allocated memory is still 204.5 MB. Free memory was 157.8 MB in the beginning and 154.7 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 68.38 ms. Allocated memory is still 204.5 MB. Free memory was 154.7 MB in the beginning and 152.1 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1080.53 ms. Allocated memory was 204.5 MB in the beginning and 232.8 MB in the end (delta: 28.3 MB). Free memory was 152.1 MB in the beginning and 203.8 MB in the end (delta: -51.6 MB). Peak memory consumption was 62.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 129164.05 ms. Allocated memory was 232.8 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 203.8 MB in the beginning and 2.6 GB in the end (delta: -2.4 GB). Peak memory consumption was 479.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.1s, 197 ProgramPointsBefore, 108 ProgramPointsAfterwards, 243 TransitionsBefore, 130 TransitionsAfterwards, 24630 CoEnabledTransitionPairs, 7 FixpointIterations, 36 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 52 ConcurrentYvCompositions, 28 ChoiceCompositions, 9487 VarBasedMoverChecksPositive, 322 VarBasedMoverChecksNegative, 94 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.6s, 0 MoverChecksTotal, 124432 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L840] FCALL, FORK 0 pthread_create(&t29, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L842] FCALL, FORK 0 pthread_create(&t30, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L844] FCALL, FORK 0 pthread_create(&t31, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L791] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L792] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L793] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L794] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L795] 3 y$r_buff0_thd3 = (_Bool)1 [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 y$flush_delayed = weak$$choice2 [L801] 3 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L804] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L805] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L805] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L806] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L808] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L810] 3 y = y$flush_delayed ? y$mem_tmp : y [L811] 3 y$flush_delayed = (_Bool)0 [L814] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L755] 2 x = 1 [L758] 2 __unbuffered_p1_EAX = x [L761] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L762] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L763] 2 y$flush_delayed = weak$$choice2 [L764] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L765] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L817] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L818] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L819] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L765] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L766] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L767] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L768] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L769] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L770] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L771] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L771] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L772] 2 __unbuffered_p1_EBX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L846] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L850] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L851] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L852] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L853] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 188 locations, 2 error locations. Result: UNSAFE, OverallTime: 128.8s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 37.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3820 SDtfs, 6151 SDslu, 9838 SDs, 0 SdLazy, 6755 SolverSat, 268 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 17 SyntacticMatches, 4 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160321occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 75.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 192292 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 613 NumberOfCodeBlocks, 613 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 69090 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...