/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/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:03:25,875 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:03:25,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:03:25,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:03:25,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:03:25,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:03:25,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:03:25,895 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:03:25,897 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:03:25,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:03:25,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:03:25,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:03:25,900 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:03:25,901 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:03:25,902 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:03:25,903 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:03:25,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:03:25,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:03:25,907 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:03:25,908 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:03:25,910 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:03:25,911 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:03:25,912 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:03:25,913 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:03:25,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:03:25,916 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:03:25,916 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:03:25,917 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:03:25,917 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:03:25,918 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:03:25,918 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:03:25,919 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:03:25,920 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:03:25,921 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:03:25,922 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:03:25,922 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:03:25,923 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:03:25,923 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:03:25,923 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:03:25,924 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:03:25,925 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:03:25,926 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 07:03:25,941 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:03:25,941 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:03:25,942 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:03:25,943 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:03:25,943 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:03:25,943 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:03:25,943 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:03:25,944 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:03:25,944 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:03:25,944 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:03:25,944 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:03:25,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:03:25,945 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:03:25,945 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:03:25,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:03:25,945 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:03:25,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:03:25,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:03:25,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:03:25,946 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:03:25,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:03:25,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:03:25,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:03:25,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:03:25,947 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:03:25,948 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:03:25,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:03:25,948 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:03:25,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:03:25,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:03:26,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:03:26,248 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:03:26,251 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:03:26,252 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:03:26,253 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:03:26,254 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i [2019-12-27 07:03:26,321 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789991e2a/9d4b68f8d871400497db61057a3416e3/FLAG391dc6189 [2019-12-27 07:03:26,948 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:03:26,949 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_tso.oepc.i [2019-12-27 07:03:26,975 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789991e2a/9d4b68f8d871400497db61057a3416e3/FLAG391dc6189 [2019-12-27 07:03:27,126 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/789991e2a/9d4b68f8d871400497db61057a3416e3 [2019-12-27 07:03:27,138 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:03:27,140 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:03:27,144 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:03:27,144 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:03:27,148 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:03:27,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:27,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d49405a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27, skipping insertion in model container [2019-12-27 07:03:27,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:27,163 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:03:27,228 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:03:27,787 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:03:27,804 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:03:27,910 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:03:27,980 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:03:27,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27 WrapperNode [2019-12-27 07:03:27,980 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:03:27,981 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:03:27,981 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:03:27,981 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:03:27,990 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,016 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,060 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:03:28,060 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:03:28,060 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:03:28,061 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:03:28,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,091 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,102 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (1/1) ... [2019-12-27 07:03:28,108 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:03:28,109 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:03:28,109 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:03:28,109 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:03:28,110 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (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-27 07:03:28,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:03:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:03:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:03:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:03:28,194 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:03:28,195 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:03:28,195 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:03:28,196 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:03:28,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:03:28,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:03:28,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:03:28,200 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:03:29,342 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:03:29,343 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:03:29,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:03:29 BoogieIcfgContainer [2019-12-27 07:03:29,345 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:03:29,347 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:03:29,347 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:03:29,351 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:03:29,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:03:27" (1/3) ... [2019-12-27 07:03:29,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42df48c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:03:29, skipping insertion in model container [2019-12-27 07:03:29,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:03:27" (2/3) ... [2019-12-27 07:03:29,354 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42df48c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:03:29, skipping insertion in model container [2019-12-27 07:03:29,354 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:03:29" (3/3) ... [2019-12-27 07:03:29,358 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_tso.oepc.i [2019-12-27 07:03:29,369 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:03:29,369 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:03:29,380 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:03:29,381 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:03:29,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,443 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,444 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,444 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,444 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,445 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,446 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,447 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,448 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,449 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,450 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,452 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,452 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,452 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,453 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,453 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,454 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,455 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,456 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,457 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,458 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,459 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,460 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,461 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,462 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,463 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,464 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,465 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,466 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,467 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,468 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,469 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,470 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,471 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,472 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,473 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,474 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,475 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,476 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,477 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,478 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,479 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,480 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,481 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,482 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,483 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,484 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,485 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,486 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,487 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,488 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,489 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,490 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,491 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,492 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,496 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,497 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,498 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,498 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,500 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,501 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,502 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,503 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,504 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,505 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,506 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,507 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,507 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,508 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,508 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,509 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,510 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,511 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,511 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,512 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:03:29,529 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:03:29,552 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:03:29,553 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:03:29,553 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:03:29,553 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:03:29,553 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:03:29,553 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:03:29,553 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:03:29,553 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:03:29,579 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-27 07:03:29,581 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-27 07:03:29,752 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-27 07:03:29,753 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:03:29,792 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-27 07:03:29,873 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-27 07:03:30,014 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-27 07:03:30,014 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:03:30,034 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 708 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-27 07:03:30,074 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 40114 [2019-12-27 07:03:30,075 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:03:33,797 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-27 07:03:33,924 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:03:33,998 INFO L206 etLargeBlockEncoding]: Checked pairs total: 240611 [2019-12-27 07:03:33,999 INFO L214 etLargeBlockEncoding]: Total number of compositions: 135 [2019-12-27 07:03:34,002 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 187 transitions [2019-12-27 07:03:37,787 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 51378 states. [2019-12-27 07:03:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 51378 states. [2019-12-27 07:03:37,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:03:37,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:37,797 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:03:37,797 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:37,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:37,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1263882776, now seen corresponding path program 1 times [2019-12-27 07:03:37,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:37,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355210549] [2019-12-27 07:03:37,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:37,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:38,085 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-27 07:03:38,085 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355210549] [2019-12-27 07:03:38,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:38,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:03:38,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994812467] [2019-12-27 07:03:38,092 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:38,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:38,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:38,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:38,110 INFO L87 Difference]: Start difference. First operand 51378 states. Second operand 3 states. [2019-12-27 07:03:38,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:38,811 INFO L93 Difference]: Finished difference Result 51288 states and 183394 transitions. [2019-12-27 07:03:38,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:38,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:03:38,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:39,223 INFO L225 Difference]: With dead ends: 51288 [2019-12-27 07:03:39,224 INFO L226 Difference]: Without dead ends: 50287 [2019-12-27 07:03:39,225 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-27 07:03:41,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50287 states. [2019-12-27 07:03:42,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50287 to 50287. [2019-12-27 07:03:42,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50287 states. [2019-12-27 07:03:43,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50287 states to 50287 states and 180053 transitions. [2019-12-27 07:03:43,167 INFO L78 Accepts]: Start accepts. Automaton has 50287 states and 180053 transitions. Word has length 5 [2019-12-27 07:03:43,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:43,168 INFO L462 AbstractCegarLoop]: Abstraction has 50287 states and 180053 transitions. [2019-12-27 07:03:43,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:43,168 INFO L276 IsEmpty]: Start isEmpty. Operand 50287 states and 180053 transitions. [2019-12-27 07:03:43,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:03:43,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:43,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:43,172 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:43,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:43,172 INFO L82 PathProgramCache]: Analyzing trace with hash 912819133, now seen corresponding path program 1 times [2019-12-27 07:03:43,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:43,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586530686] [2019-12-27 07:03:43,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:43,301 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-27 07:03:43,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586530686] [2019-12-27 07:03:43,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:43,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:43,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372405228] [2019-12-27 07:03:43,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:43,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:43,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:43,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:43,305 INFO L87 Difference]: Start difference. First operand 50287 states and 180053 transitions. Second operand 4 states. [2019-12-27 07:03:43,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:43,408 INFO L93 Difference]: Finished difference Result 6428 states and 16941 transitions. [2019-12-27 07:03:43,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:03:43,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:03:43,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:43,419 INFO L225 Difference]: With dead ends: 6428 [2019-12-27 07:03:43,419 INFO L226 Difference]: Without dead ends: 5433 [2019-12-27 07:03:43,421 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-27 07:03:43,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5433 states. [2019-12-27 07:03:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5433 to 5433. [2019-12-27 07:03:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5433 states. [2019-12-27 07:03:43,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5433 states to 5433 states and 13708 transitions. [2019-12-27 07:03:43,546 INFO L78 Accepts]: Start accepts. Automaton has 5433 states and 13708 transitions. Word has length 11 [2019-12-27 07:03:43,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:43,547 INFO L462 AbstractCegarLoop]: Abstraction has 5433 states and 13708 transitions. [2019-12-27 07:03:43,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:43,547 INFO L276 IsEmpty]: Start isEmpty. Operand 5433 states and 13708 transitions. [2019-12-27 07:03:43,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:03:43,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:43,554 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:43,554 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:43,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:43,554 INFO L82 PathProgramCache]: Analyzing trace with hash 1971624387, now seen corresponding path program 1 times [2019-12-27 07:03:43,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:43,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041000507] [2019-12-27 07:03:43,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:43,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:43,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-27 07:03:43,683 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041000507] [2019-12-27 07:03:43,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:43,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:43,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044785354] [2019-12-27 07:03:43,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:03:43,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:43,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:03:43,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:03:43,686 INFO L87 Difference]: Start difference. First operand 5433 states and 13708 transitions. Second operand 4 states. [2019-12-27 07:03:44,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:44,211 INFO L93 Difference]: Finished difference Result 6766 states and 16535 transitions. [2019-12-27 07:03:44,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:44,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:03:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:44,223 INFO L225 Difference]: With dead ends: 6766 [2019-12-27 07:03:44,223 INFO L226 Difference]: Without dead ends: 6753 [2019-12-27 07:03:44,223 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-27 07:03:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6753 states. [2019-12-27 07:03:44,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6753 to 6597. [2019-12-27 07:03:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6597 states. [2019-12-27 07:03:44,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6597 states to 6597 states and 16220 transitions. [2019-12-27 07:03:44,358 INFO L78 Accepts]: Start accepts. Automaton has 6597 states and 16220 transitions. Word has length 11 [2019-12-27 07:03:44,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:44,358 INFO L462 AbstractCegarLoop]: Abstraction has 6597 states and 16220 transitions. [2019-12-27 07:03:44,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:03:44,359 INFO L276 IsEmpty]: Start isEmpty. Operand 6597 states and 16220 transitions. [2019-12-27 07:03:44,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 07:03:44,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:44,361 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] [2019-12-27 07:03:44,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:44,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:44,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1381706660, now seen corresponding path program 1 times [2019-12-27 07:03:44,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:44,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731040160] [2019-12-27 07:03:44,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:44,570 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-27 07:03:44,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731040160] [2019-12-27 07:03:44,570 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:44,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:03:44,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524993242] [2019-12-27 07:03:44,571 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:03:44,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:44,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:03:44,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:03:44,572 INFO L87 Difference]: Start difference. First operand 6597 states and 16220 transitions. Second operand 7 states. [2019-12-27 07:03:46,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:46,382 INFO L93 Difference]: Finished difference Result 8324 states and 20116 transitions. [2019-12-27 07:03:46,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:03:46,382 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-12-27 07:03:46,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:46,397 INFO L225 Difference]: With dead ends: 8324 [2019-12-27 07:03:46,397 INFO L226 Difference]: Without dead ends: 8324 [2019-12-27 07:03:46,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:03:46,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8324 states. [2019-12-27 07:03:46,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8324 to 8091. [2019-12-27 07:03:46,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8091 states. [2019-12-27 07:03:46,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8091 states to 8091 states and 19664 transitions. [2019-12-27 07:03:46,551 INFO L78 Accepts]: Start accepts. Automaton has 8091 states and 19664 transitions. Word has length 23 [2019-12-27 07:03:46,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:46,551 INFO L462 AbstractCegarLoop]: Abstraction has 8091 states and 19664 transitions. [2019-12-27 07:03:46,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:03:46,552 INFO L276 IsEmpty]: Start isEmpty. Operand 8091 states and 19664 transitions. [2019-12-27 07:03:46,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 07:03:46,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:46,557 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] [2019-12-27 07:03:46,558 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:46,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:46,558 INFO L82 PathProgramCache]: Analyzing trace with hash -472381303, now seen corresponding path program 1 times [2019-12-27 07:03:46,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:46,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785712424] [2019-12-27 07:03:46,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:46,653 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-27 07:03:46,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785712424] [2019-12-27 07:03:46,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:46,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:03:46,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056513016] [2019-12-27 07:03:46,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:46,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:46,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:46,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:46,656 INFO L87 Difference]: Start difference. First operand 8091 states and 19664 transitions. Second operand 5 states. [2019-12-27 07:03:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:46,707 INFO L93 Difference]: Finished difference Result 1879 states and 4087 transitions. [2019-12-27 07:03:46,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:03:46,707 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 07:03:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:46,710 INFO L225 Difference]: With dead ends: 1879 [2019-12-27 07:03:46,710 INFO L226 Difference]: Without dead ends: 1707 [2019-12-27 07:03:46,710 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-27 07:03:46,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-12-27 07:03:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1637. [2019-12-27 07:03:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-12-27 07:03:46,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 3578 transitions. [2019-12-27 07:03:46,738 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 3578 transitions. Word has length 37 [2019-12-27 07:03:46,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:46,738 INFO L462 AbstractCegarLoop]: Abstraction has 1637 states and 3578 transitions. [2019-12-27 07:03:46,738 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:46,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 3578 transitions. [2019-12-27 07:03:46,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 07:03:46,744 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:46,744 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:46,744 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:46,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:46,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1952682634, now seen corresponding path program 1 times [2019-12-27 07:03:46,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:46,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284091172] [2019-12-27 07:03:46,745 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:46,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:46,842 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-27 07:03:46,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284091172] [2019-12-27 07:03:46,843 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:46,843 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:03:46,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967312932] [2019-12-27 07:03:46,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:46,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:46,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:46,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:46,845 INFO L87 Difference]: Start difference. First operand 1637 states and 3578 transitions. Second operand 3 states. [2019-12-27 07:03:46,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:46,865 INFO L93 Difference]: Finished difference Result 1637 states and 3502 transitions. [2019-12-27 07:03:46,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:46,865 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-12-27 07:03:46,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:46,867 INFO L225 Difference]: With dead ends: 1637 [2019-12-27 07:03:46,867 INFO L226 Difference]: Without dead ends: 1637 [2019-12-27 07:03:46,868 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-27 07:03:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1637 states. [2019-12-27 07:03:46,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1637 to 1637. [2019-12-27 07:03:46,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1637 states. [2019-12-27 07:03:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1637 states to 1637 states and 3502 transitions. [2019-12-27 07:03:46,890 INFO L78 Accepts]: Start accepts. Automaton has 1637 states and 3502 transitions. Word has length 83 [2019-12-27 07:03:46,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:46,890 INFO L462 AbstractCegarLoop]: Abstraction has 1637 states and 3502 transitions. [2019-12-27 07:03:46,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:46,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1637 states and 3502 transitions. [2019-12-27 07:03:46,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 07:03:46,894 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:46,894 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:46,895 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:46,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:46,895 INFO L82 PathProgramCache]: Analyzing trace with hash 1163871079, now seen corresponding path program 1 times [2019-12-27 07:03:46,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:46,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005534607] [2019-12-27 07:03:46,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:47,003 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-27 07:03:47,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005534607] [2019-12-27 07:03:47,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:47,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:03:47,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347488319] [2019-12-27 07:03:47,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:03:47,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:47,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:03:47,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:03:47,006 INFO L87 Difference]: Start difference. First operand 1637 states and 3502 transitions. Second operand 5 states. [2019-12-27 07:03:47,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:47,313 INFO L93 Difference]: Finished difference Result 1775 states and 3750 transitions. [2019-12-27 07:03:47,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 07:03:47,313 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 84 [2019-12-27 07:03:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:47,316 INFO L225 Difference]: With dead ends: 1775 [2019-12-27 07:03:47,317 INFO L226 Difference]: Without dead ends: 1775 [2019-12-27 07:03:47,317 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:03:47,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2019-12-27 07:03:47,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1722. [2019-12-27 07:03:47,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-12-27 07:03:47,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 3656 transitions. [2019-12-27 07:03:47,351 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 3656 transitions. Word has length 84 [2019-12-27 07:03:47,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:47,352 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 3656 transitions. [2019-12-27 07:03:47,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:03:47,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 3656 transitions. [2019-12-27 07:03:47,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-12-27 07:03:47,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:47,357 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:47,358 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:47,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:47,358 INFO L82 PathProgramCache]: Analyzing trace with hash -1309398995, now seen corresponding path program 2 times [2019-12-27 07:03:47,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:47,359 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789992319] [2019-12-27 07:03:47,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:47,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:47,695 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-27 07:03:47,695 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789992319] [2019-12-27 07:03:47,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:47,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:03:47,696 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499179443] [2019-12-27 07:03:47,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:03:47,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:47,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:03:47,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:03:47,700 INFO L87 Difference]: Start difference. First operand 1722 states and 3656 transitions. Second operand 10 states. [2019-12-27 07:03:49,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:49,112 INFO L93 Difference]: Finished difference Result 2579 states and 5381 transitions. [2019-12-27 07:03:49,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:03:49,112 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-12-27 07:03:49,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:49,118 INFO L225 Difference]: With dead ends: 2579 [2019-12-27 07:03:49,118 INFO L226 Difference]: Without dead ends: 2579 [2019-12-27 07:03:49,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:03:49,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2579 states. [2019-12-27 07:03:49,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2579 to 2144. [2019-12-27 07:03:49,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2144 states. [2019-12-27 07:03:49,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2144 states to 2144 states and 4505 transitions. [2019-12-27 07:03:49,164 INFO L78 Accepts]: Start accepts. Automaton has 2144 states and 4505 transitions. Word has length 84 [2019-12-27 07:03:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:49,165 INFO L462 AbstractCegarLoop]: Abstraction has 2144 states and 4505 transitions. [2019-12-27 07:03:49,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:03:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 2144 states and 4505 transitions. [2019-12-27 07:03:49,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 07:03:49,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:49,170 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:49,171 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:49,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:49,171 INFO L82 PathProgramCache]: Analyzing trace with hash -960447784, now seen corresponding path program 1 times [2019-12-27 07:03:49,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:49,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853764858] [2019-12-27 07:03:49,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:49,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:49,416 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-27 07:03:49,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853764858] [2019-12-27 07:03:49,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:49,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 07:03:49,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694839108] [2019-12-27 07:03:49,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:03:49,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:49,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:03:49,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:03:49,424 INFO L87 Difference]: Start difference. First operand 2144 states and 4505 transitions. Second operand 9 states. [2019-12-27 07:03:49,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:49,674 INFO L93 Difference]: Finished difference Result 3143 states and 6556 transitions. [2019-12-27 07:03:49,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:03:49,675 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 85 [2019-12-27 07:03:49,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:49,680 INFO L225 Difference]: With dead ends: 3143 [2019-12-27 07:03:49,680 INFO L226 Difference]: Without dead ends: 3111 [2019-12-27 07:03:49,680 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:03:49,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2019-12-27 07:03:49,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 2905. [2019-12-27 07:03:49,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2905 states. [2019-12-27 07:03:49,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2905 states to 2905 states and 6163 transitions. [2019-12-27 07:03:49,729 INFO L78 Accepts]: Start accepts. Automaton has 2905 states and 6163 transitions. Word has length 85 [2019-12-27 07:03:49,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:49,729 INFO L462 AbstractCegarLoop]: Abstraction has 2905 states and 6163 transitions. [2019-12-27 07:03:49,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:03:49,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2905 states and 6163 transitions. [2019-12-27 07:03:49,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 07:03:49,736 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:49,737 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:49,737 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:49,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:49,737 INFO L82 PathProgramCache]: Analyzing trace with hash -50509752, now seen corresponding path program 1 times [2019-12-27 07:03:49,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:49,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628211648] [2019-12-27 07:03:49,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:49,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:49,980 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-27 07:03:49,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628211648] [2019-12-27 07:03:49,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:49,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 07:03:49,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517083178] [2019-12-27 07:03:49,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 07:03:49,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:49,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 07:03:49,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:03:49,983 INFO L87 Difference]: Start difference. First operand 2905 states and 6163 transitions. Second operand 10 states. [2019-12-27 07:03:51,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:51,095 INFO L93 Difference]: Finished difference Result 4779 states and 10176 transitions. [2019-12-27 07:03:51,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 07:03:51,095 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2019-12-27 07:03:51,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:51,102 INFO L225 Difference]: With dead ends: 4779 [2019-12-27 07:03:51,102 INFO L226 Difference]: Without dead ends: 4779 [2019-12-27 07:03:51,103 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2019-12-27 07:03:51,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4779 states. [2019-12-27 07:03:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4779 to 3155. [2019-12-27 07:03:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3155 states. [2019-12-27 07:03:51,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3155 states to 3155 states and 6720 transitions. [2019-12-27 07:03:51,150 INFO L78 Accepts]: Start accepts. Automaton has 3155 states and 6720 transitions. Word has length 85 [2019-12-27 07:03:51,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:51,150 INFO L462 AbstractCegarLoop]: Abstraction has 3155 states and 6720 transitions. [2019-12-27 07:03:51,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 07:03:51,151 INFO L276 IsEmpty]: Start isEmpty. Operand 3155 states and 6720 transitions. [2019-12-27 07:03:51,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-27 07:03:51,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:51,159 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:03:51,159 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:51,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:51,159 INFO L82 PathProgramCache]: Analyzing trace with hash -712209204, now seen corresponding path program 2 times [2019-12-27 07:03:51,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:51,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299704681] [2019-12-27 07:03:51,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:51,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:51,442 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-27 07:03:51,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299704681] [2019-12-27 07:03:51,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:51,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 07:03:51,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654275681] [2019-12-27 07:03:51,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 07:03:51,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:51,446 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 07:03:51,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:03:51,446 INFO L87 Difference]: Start difference. First operand 3155 states and 6720 transitions. Second operand 13 states. [2019-12-27 07:03:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:52,022 INFO L93 Difference]: Finished difference Result 3625 states and 7512 transitions. [2019-12-27 07:03:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 07:03:52,022 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 85 [2019-12-27 07:03:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:52,027 INFO L225 Difference]: With dead ends: 3625 [2019-12-27 07:03:52,027 INFO L226 Difference]: Without dead ends: 3521 [2019-12-27 07:03:52,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=416, Unknown=0, NotChecked=0, Total=506 [2019-12-27 07:03:52,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3521 states. [2019-12-27 07:03:52,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3521 to 2881. [2019-12-27 07:03:52,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-12-27 07:03:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 6158 transitions. [2019-12-27 07:03:52,060 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 6158 transitions. Word has length 85 [2019-12-27 07:03:52,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:52,061 INFO L462 AbstractCegarLoop]: Abstraction has 2881 states and 6158 transitions. [2019-12-27 07:03:52,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 07:03:52,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 6158 transitions. [2019-12-27 07:03:52,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 07:03:52,067 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:52,067 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, 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-27 07:03:52,067 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:52,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:52,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1417450926, now seen corresponding path program 1 times [2019-12-27 07:03:52,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:52,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899497954] [2019-12-27 07:03:52,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:52,163 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-27 07:03:52,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899497954] [2019-12-27 07:03:52,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:52,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:03:52,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564823004] [2019-12-27 07:03:52,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:03:52,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:52,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:03:52,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:03:52,165 INFO L87 Difference]: Start difference. First operand 2881 states and 6158 transitions. Second operand 6 states. [2019-12-27 07:03:52,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:52,539 INFO L93 Difference]: Finished difference Result 3120 states and 6563 transitions. [2019-12-27 07:03:52,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:03:52,539 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-27 07:03:52,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:52,543 INFO L225 Difference]: With dead ends: 3120 [2019-12-27 07:03:52,543 INFO L226 Difference]: Without dead ends: 2988 [2019-12-27 07:03:52,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:03:52,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2988 states. [2019-12-27 07:03:52,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2988 to 2838. [2019-12-27 07:03:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2838 states. [2019-12-27 07:03:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2838 states to 2838 states and 6052 transitions. [2019-12-27 07:03:52,587 INFO L78 Accepts]: Start accepts. Automaton has 2838 states and 6052 transitions. Word has length 86 [2019-12-27 07:03:52,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:52,587 INFO L462 AbstractCegarLoop]: Abstraction has 2838 states and 6052 transitions. [2019-12-27 07:03:52,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:03:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2838 states and 6052 transitions. [2019-12-27 07:03:52,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 07:03:52,592 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:52,593 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, 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-27 07:03:52,593 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:52,593 INFO L82 PathProgramCache]: Analyzing trace with hash 1294898533, now seen corresponding path program 1 times [2019-12-27 07:03:52,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:52,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449486171] [2019-12-27 07:03:52,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:53,001 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-27 07:03:53,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449486171] [2019-12-27 07:03:53,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:53,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-27 07:03:53,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963903018] [2019-12-27 07:03:53,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 07:03:53,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:53,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 07:03:53,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=330, Unknown=0, NotChecked=0, Total=380 [2019-12-27 07:03:53,004 INFO L87 Difference]: Start difference. First operand 2838 states and 6052 transitions. Second operand 20 states. [2019-12-27 07:03:54,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:54,680 INFO L93 Difference]: Finished difference Result 6827 states and 14610 transitions. [2019-12-27 07:03:54,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 07:03:54,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 86 [2019-12-27 07:03:54,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:54,689 INFO L225 Difference]: With dead ends: 6827 [2019-12-27 07:03:54,689 INFO L226 Difference]: Without dead ends: 6725 [2019-12-27 07:03:54,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=145, Invalid=1045, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 07:03:54,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6725 states. [2019-12-27 07:03:54,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6725 to 4404. [2019-12-27 07:03:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4404 states. [2019-12-27 07:03:54,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4404 states to 4404 states and 9636 transitions. [2019-12-27 07:03:54,786 INFO L78 Accepts]: Start accepts. Automaton has 4404 states and 9636 transitions. Word has length 86 [2019-12-27 07:03:54,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:54,786 INFO L462 AbstractCegarLoop]: Abstraction has 4404 states and 9636 transitions. [2019-12-27 07:03:54,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 07:03:54,787 INFO L276 IsEmpty]: Start isEmpty. Operand 4404 states and 9636 transitions. [2019-12-27 07:03:54,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-27 07:03:54,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:54,795 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, 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-27 07:03:54,796 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:54,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:54,796 INFO L82 PathProgramCache]: Analyzing trace with hash 985277169, now seen corresponding path program 1 times [2019-12-27 07:03:54,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:54,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883775218] [2019-12-27 07:03:54,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:54,840 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-27 07:03:54,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883775218] [2019-12-27 07:03:54,841 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:54,841 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:03:54,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499114849] [2019-12-27 07:03:54,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:03:54,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:54,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:03:54,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:03:54,842 INFO L87 Difference]: Start difference. First operand 4404 states and 9636 transitions. Second operand 3 states. [2019-12-27 07:03:54,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:03:54,932 INFO L93 Difference]: Finished difference Result 4401 states and 8936 transitions. [2019-12-27 07:03:54,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:03:54,932 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-27 07:03:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:03:54,938 INFO L225 Difference]: With dead ends: 4401 [2019-12-27 07:03:54,938 INFO L226 Difference]: Without dead ends: 4401 [2019-12-27 07:03:54,938 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-27 07:03:54,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4401 states. [2019-12-27 07:03:54,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4401 to 3655. [2019-12-27 07:03:54,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3655 states. [2019-12-27 07:03:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3655 states to 3655 states and 7544 transitions. [2019-12-27 07:03:54,995 INFO L78 Accepts]: Start accepts. Automaton has 3655 states and 7544 transitions. Word has length 86 [2019-12-27 07:03:54,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:03:54,995 INFO L462 AbstractCegarLoop]: Abstraction has 3655 states and 7544 transitions. [2019-12-27 07:03:54,995 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:03:54,995 INFO L276 IsEmpty]: Start isEmpty. Operand 3655 states and 7544 transitions. [2019-12-27 07:03:55,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:03:55,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:03:55,002 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, 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-27 07:03:55,002 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:03:55,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:03:55,003 INFO L82 PathProgramCache]: Analyzing trace with hash 509984995, now seen corresponding path program 1 times [2019-12-27 07:03:55,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:03:55,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090034135] [2019-12-27 07:03:55,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:03:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:03:56,168 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-27 07:03:56,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090034135] [2019-12-27 07:03:56,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:03:56,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-27 07:03:56,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372791747] [2019-12-27 07:03:56,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-27 07:03:56,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:03:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-27 07:03:56,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=400, Unknown=0, NotChecked=0, Total=462 [2019-12-27 07:03:56,170 INFO L87 Difference]: Start difference. First operand 3655 states and 7544 transitions. Second operand 22 states. [2019-12-27 07:04:02,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:02,525 INFO L93 Difference]: Finished difference Result 6936 states and 14390 transitions. [2019-12-27 07:04:02,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 07:04:02,525 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 87 [2019-12-27 07:04:02,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:02,534 INFO L225 Difference]: With dead ends: 6936 [2019-12-27 07:04:02,534 INFO L226 Difference]: Without dead ends: 6822 [2019-12-27 07:04:02,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=373, Invalid=2489, Unknown=0, NotChecked=0, Total=2862 [2019-12-27 07:04:02,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6822 states. [2019-12-27 07:04:02,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6822 to 3736. [2019-12-27 07:04:02,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3736 states. [2019-12-27 07:04:02,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3736 states to 3736 states and 7730 transitions. [2019-12-27 07:04:02,606 INFO L78 Accepts]: Start accepts. Automaton has 3736 states and 7730 transitions. Word has length 87 [2019-12-27 07:04:02,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:02,607 INFO L462 AbstractCegarLoop]: Abstraction has 3736 states and 7730 transitions. [2019-12-27 07:04:02,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-27 07:04:02,607 INFO L276 IsEmpty]: Start isEmpty. Operand 3736 states and 7730 transitions. [2019-12-27 07:04:02,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:04:02,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:02,615 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, 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-27 07:04:02,615 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:02,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:02,615 INFO L82 PathProgramCache]: Analyzing trace with hash -802667593, now seen corresponding path program 2 times [2019-12-27 07:04:02,616 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:02,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74058461] [2019-12-27 07:04:02,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:03,046 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-27 07:04:03,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74058461] [2019-12-27 07:04:03,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:03,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 07:04:03,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881554068] [2019-12-27 07:04:03,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 07:04:03,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:03,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 07:04:03,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2019-12-27 07:04:03,051 INFO L87 Difference]: Start difference. First operand 3736 states and 7730 transitions. Second operand 15 states. [2019-12-27 07:04:05,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:05,232 INFO L93 Difference]: Finished difference Result 5916 states and 12193 transitions. [2019-12-27 07:04:05,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 07:04:05,232 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 87 [2019-12-27 07:04:05,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:05,239 INFO L225 Difference]: With dead ends: 5916 [2019-12-27 07:04:05,239 INFO L226 Difference]: Without dead ends: 5802 [2019-12-27 07:04:05,240 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=937, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 07:04:05,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5802 states. [2019-12-27 07:04:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5802 to 3822. [2019-12-27 07:04:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3822 states. [2019-12-27 07:04:05,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3822 states to 3822 states and 7911 transitions. [2019-12-27 07:04:05,299 INFO L78 Accepts]: Start accepts. Automaton has 3822 states and 7911 transitions. Word has length 87 [2019-12-27 07:04:05,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:05,299 INFO L462 AbstractCegarLoop]: Abstraction has 3822 states and 7911 transitions. [2019-12-27 07:04:05,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 07:04:05,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3822 states and 7911 transitions. [2019-12-27 07:04:05,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:04:05,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:05,307 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, 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-27 07:04:05,307 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:05,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:05,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1551378967, now seen corresponding path program 3 times [2019-12-27 07:04:05,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:05,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667949764] [2019-12-27 07:04:05,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:05,803 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-27 07:04:05,803 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667949764] [2019-12-27 07:04:05,803 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:05,803 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 07:04:05,804 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942436125] [2019-12-27 07:04:05,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 07:04:05,804 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:05,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 07:04:05,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:04:05,805 INFO L87 Difference]: Start difference. First operand 3822 states and 7911 transitions. Second operand 16 states. [2019-12-27 07:04:09,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:09,108 INFO L93 Difference]: Finished difference Result 6794 states and 14030 transitions. [2019-12-27 07:04:09,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 07:04:09,109 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 87 [2019-12-27 07:04:09,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:09,116 INFO L225 Difference]: With dead ends: 6794 [2019-12-27 07:04:09,116 INFO L226 Difference]: Without dead ends: 6680 [2019-12-27 07:04:09,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=272, Invalid=1450, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 07:04:09,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6680 states. [2019-12-27 07:04:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6680 to 3888. [2019-12-27 07:04:09,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3888 states. [2019-12-27 07:04:09,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3888 states to 3888 states and 8057 transitions. [2019-12-27 07:04:09,165 INFO L78 Accepts]: Start accepts. Automaton has 3888 states and 8057 transitions. Word has length 87 [2019-12-27 07:04:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:09,165 INFO L462 AbstractCegarLoop]: Abstraction has 3888 states and 8057 transitions. [2019-12-27 07:04:09,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 07:04:09,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3888 states and 8057 transitions. [2019-12-27 07:04:09,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-27 07:04:09,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:09,171 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, 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-27 07:04:09,171 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:09,171 INFO L82 PathProgramCache]: Analyzing trace with hash -1407741859, now seen corresponding path program 4 times [2019-12-27 07:04:09,171 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:09,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673491284] [2019-12-27 07:04:09,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:09,304 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:04:09,304 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:04:09,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_50| 0 0))) (and (= 0 v_~weak$$choice0~0_10) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1597~0.base_23| 4) |v_#length_15|) (= |v_#NULL.offset_7| 0) (= 0 v_~y$r_buff0_thd2~0_127) (= 0 v_~y$r_buff1_thd1~0_20) (= 0 v_~weak$$choice2~0_48) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 v_~y$w_buff1~0_39) (= v_~y~0_47 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1597~0.base_23| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1597~0.base_23|) |v_ULTIMATE.start_main_~#t1597~0.offset_17| 0)) |v_#memory_int_15|) (= v_~y$r_buff0_thd0~0_65 0) (= v_~y$w_buff0_used~0_182 0) (= 0 v_~__unbuffered_p1_EAX~0_10) (= 0 v_~y$read_delayed_var~0.offset_5) (< 0 |v_#StackHeapBarrier_14|) (= v_~y$mem_tmp~0_15 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_23|) 0) (= v_~y$w_buff1_used~0_96 0) (= 0 v_~y$w_buff0~0_43) (= 0 v_~y$r_buff1_thd0~0_36) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1597~0.base_23|) (= v_~y$read_delayed~0_5 0) (= 0 |v_ULTIMATE.start_main_~#t1597~0.offset_17|) (= 0 |v_#NULL.base_7|) (= 0 v_~y$flush_delayed~0_26) (= v_~main$tmp_guard1~0_15 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1597~0.base_23| 1) |v_#valid_48|) (= v_~x~0_12 0) (= v_~main$tmp_guard0~0_11 0) (= v_~__unbuffered_p1_EBX~0_11 0) (= 0 v_~y$r_buff1_thd2~0_64) (= 0 v_~__unbuffered_cnt~0_16) (= v_~y$r_buff0_thd1~0_20 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_50|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1597~0.offset=|v_ULTIMATE.start_main_~#t1597~0.offset_17|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_9|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_9|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_14|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_12|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_7|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_11|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_12|, ~y$read_delayed~0=v_~y$read_delayed~0_5, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_11|, ~y$mem_tmp~0=v_~y$mem_tmp~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_14|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_20, ~y$flush_delayed~0=v_~y$flush_delayed~0_26, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_6|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_12|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_13|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_13|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_11|, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_12|, ~y$w_buff1~0=v_~y$w_buff1~0_39, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_13|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_127, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t1597~0.base=|v_ULTIMATE.start_main_~#t1597~0.base_23|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_182, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_9|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_9|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_13|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_13|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_20, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_11|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_20|, ~y$w_buff0~0=v_~y$w_buff0~0_43, ~y~0=v_~y~0_47, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_11, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_7|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_17|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_11, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_7|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_11|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_12|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_64, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_13|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_11|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_15|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_65, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_15|, ~weak$$choice2~0=v_~weak$$choice2~0_48, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_14|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_96} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1597~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1597~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ULTIMATE.start_main_~#t1598~0.base, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1598~0.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:04:09,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1264] [1264] L813-1-->L815: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t1598~0.offset_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1598~0.base_13|)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1598~0.base_13|) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1598~0.base_13|) |v_ULTIMATE.start_main_~#t1598~0.offset_11| 1)) |v_#memory_int_11|) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1598~0.base_13| 1) |v_#valid_27|) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1598~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_~#t1598~0.base=|v_ULTIMATE.start_main_~#t1598~0.base_13|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|, ULTIMATE.start_main_~#t1598~0.offset=|v_ULTIMATE.start_main_~#t1598~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t1598~0.base, #length, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_~#t1598~0.offset] because there is no mapped edge [2019-12-27 07:04:09,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1162] [1162] L4-->L762: Formula: (and (= v_~y$r_buff0_thd1~0_15 v_~y$r_buff1_thd1~0_11) (= v_~weak$$choice2~0_42 |v_P1Thread1of1ForFork1_#t~nondet10_8|) (= v_~y~0_31 v_~y$mem_tmp~0_10) (not (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 0)) (= v_~y$r_buff0_thd2~0_89 1) (= |v_P1Thread1of1ForFork1_#t~nondet9_8| v_~weak$$choice0~0_6) (= v_~y$r_buff0_thd2~0_90 v_~y$r_buff1_thd2~0_49) (= v_~weak$$choice2~0_42 v_~y$flush_delayed~0_16) (= v_~y$r_buff0_thd0~0_47 v_~y$r_buff1_thd0~0_29)) InVars {P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_90, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_8|, ~y~0=v_~y~0_31, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_8|} OutVars{P1Thread1of1ForFork1_#t~nondet9=|v_P1Thread1of1ForFork1_#t~nondet9_7|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_49, P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~weak$$choice0~0=v_~weak$$choice0~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_11, ~y$mem_tmp~0=v_~y$mem_tmp~0_10, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_47, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_89, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_15, ~y$flush_delayed~0=v_~y$flush_delayed~0_16, ~y~0=v_~y~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_42, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_29, P1Thread1of1ForFork1_#t~nondet10=|v_P1Thread1of1ForFork1_#t~nondet10_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd2~0, ~y$flush_delayed~0, P1Thread1of1ForFork1_#t~nondet9, ~weak$$choice2~0, ~y$r_buff1_thd0~0, P1Thread1of1ForFork1_#t~nondet10] because there is no mapped edge [2019-12-27 07:04:09,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L762-2-->L762-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In778310866 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In778310866 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out778310866| ~y$w_buff1~0_In778310866)) (and (not .cse1) (= ~y$w_buff0~0_In778310866 |P1Thread1of1ForFork1_#t~ite11_Out778310866|) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In778310866, ~y$w_buff1~0=~y$w_buff1~0_In778310866, ~y$w_buff0~0=~y$w_buff0~0_In778310866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In778310866} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In778310866, ~y$w_buff1~0=~y$w_buff1~0_In778310866, ~y$w_buff0~0=~y$w_buff0~0_In778310866, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In778310866, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out778310866|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 07:04:09,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1145] [1145] L762-4-->L763: Formula: (= v_~y~0_28 |v_P1Thread1of1ForFork1_#t~ite11_8|) InVars {P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_8|} OutVars{P1Thread1of1ForFork1_#t~ite11=|v_P1Thread1of1ForFork1_#t~ite11_7|, P1Thread1of1ForFork1_#t~ite12=|v_P1Thread1of1ForFork1_#t~ite12_7|, ~y~0=v_~y~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11, P1Thread1of1ForFork1_#t~ite12, ~y~0] because there is no mapped edge [2019-12-27 07:04:09,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1206] [1206] L767-->L768: Formula: (and (not (= (mod v_~weak$$choice2~0_45 256) 0)) (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_45} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~weak$$choice2~0=v_~weak$$choice2~0_45, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_9|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 07:04:09,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-574221601 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite31_Out-574221601| ~y$mem_tmp~0_In-574221601) (not .cse0)) (and .cse0 (= ~y~0_In-574221601 |P1Thread1of1ForFork1_#t~ite31_Out-574221601|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-574221601, ~y$flush_delayed~0=~y$flush_delayed~0_In-574221601, ~y~0=~y~0_In-574221601} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-574221601, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-574221601|, ~y$flush_delayed~0=~y$flush_delayed~0_In-574221601, ~y~0=~y~0_In-574221601} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 07:04:09,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L730-2-->L730-5: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd1~0_In-1818758654 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1818758654| |P0Thread1of1ForFork0_#t~ite3_Out-1818758654|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1818758654 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-1818758654| ~y~0_In-1818758654) .cse2) (and (not .cse0) (= |P0Thread1of1ForFork0_#t~ite3_Out-1818758654| ~y$w_buff1~0_In-1818758654) .cse2 (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1818758654, ~y$w_buff1~0=~y$w_buff1~0_In-1818758654, ~y~0=~y~0_In-1818758654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1818758654} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1818758654, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1818758654|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1818758654|, ~y$w_buff1~0=~y$w_buff1~0_In-1818758654, ~y~0=~y~0_In-1818758654, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1818758654} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 07:04:09,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1248] [1248] L778-2-->L778-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-785158861 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-785158861 256)))) (or (and (= ~y$w_buff0~0_In-785158861 |P1Thread1of1ForFork1_#t~ite34_Out-785158861|) (not .cse0) (not .cse1)) (and (= ~y$w_buff1~0_In-785158861 |P1Thread1of1ForFork1_#t~ite34_Out-785158861|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-785158861, ~y$w_buff1~0=~y$w_buff1~0_In-785158861, ~y$w_buff0~0=~y$w_buff0~0_In-785158861, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-785158861} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-785158861, ~y$w_buff1~0=~y$w_buff1~0_In-785158861, ~y$w_buff0~0=~y$w_buff0~0_In-785158861, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-785158861, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-785158861|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:04:09,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1163] [1163] L778-4-->L779: Formula: (= v_~y~0_32 |v_P1Thread1of1ForFork1_#t~ite34_8|) InVars {P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_8|} OutVars{P1Thread1of1ForFork1_#t~ite34=|v_P1Thread1of1ForFork1_#t~ite34_7|, P1Thread1of1ForFork1_#t~ite35=|v_P1Thread1of1ForFork1_#t~ite35_7|, ~y~0=v_~y~0_32} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34, P1Thread1of1ForFork1_#t~ite35, ~y~0] because there is no mapped edge [2019-12-27 07:04:09,322 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1197] [1197] L783-->L784: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~y$r_buff0_thd2~0_102 v_~y$r_buff0_thd2~0_101)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_102, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P1Thread1of1ForFork1_#t~ite50=|v_P1Thread1of1ForFork1_#t~ite50_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_101, ~weak$$choice2~0=v_~weak$$choice2~0_43, P1Thread1of1ForFork1_#t~ite49=|v_P1Thread1of1ForFork1_#t~ite49_9|, P1Thread1of1ForFork1_#t~ite48=|v_P1Thread1of1ForFork1_#t~ite48_8|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite50, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite49, P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 07:04:09,323 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1232] [1232] L786-->L786-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-620174191 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-620174191 |P1Thread1of1ForFork1_#t~ite54_Out-620174191|)) (and (= |P1Thread1of1ForFork1_#t~ite54_Out-620174191| ~y~0_In-620174191) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-620174191, ~y$flush_delayed~0=~y$flush_delayed~0_In-620174191, ~y~0=~y~0_In-620174191} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-620174191, ~y$flush_delayed~0=~y$flush_delayed~0_In-620174191, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-620174191|, ~y~0=~y~0_In-620174191} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 07:04:09,325 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L731-->L731-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In2141916269 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In2141916269 256) 0))) (or (and (= ~y$w_buff0_used~0_In2141916269 |P0Thread1of1ForFork0_#t~ite5_Out2141916269|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out2141916269|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2141916269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2141916269} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out2141916269|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2141916269, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2141916269} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:04:09,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L732-->L732-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-819364957 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-819364957 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-819364957 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-819364957 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite6_Out-819364957|)) (and (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-819364957 |P0Thread1of1ForFork0_#t~ite6_Out-819364957|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-819364957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-819364957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-819364957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-819364957} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-819364957|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-819364957, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-819364957, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-819364957, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-819364957} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:04:09,326 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L733-->L733-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In2142858613 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In2142858613 256) 0))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out2142858613|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In2142858613 |P0Thread1of1ForFork0_#t~ite7_Out2142858613|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2142858613, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2142858613} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2142858613, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2142858613|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2142858613} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:04:09,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1250] [1250] L734-->L734-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-584186162 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In-584186162 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-584186162 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-584186162 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-584186162|)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd1~0_In-584186162 |P0Thread1of1ForFork0_#t~ite8_Out-584186162|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-584186162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-584186162, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-584186162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-584186162} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-584186162, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-584186162, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-584186162|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-584186162, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-584186162} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:04:09,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1265] [1265] L734-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_16) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_16, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 07:04:09,327 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1247] [1247] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1025960409 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1025960409 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite57_Out1025960409| 0) (not .cse1)) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite57_Out1025960409| ~y$w_buff0_used~0_In1025960409)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1025960409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1025960409} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1025960409, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1025960409, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out1025960409|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-27 07:04:09,328 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1251] [1251] L792-->L792-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd2~0_In-1512784058 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1512784058 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1512784058 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1512784058 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite58_Out-1512784058| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse1 .cse0) (= |P1Thread1of1ForFork1_#t~ite58_Out-1512784058| ~y$w_buff1_used~0_In-1512784058)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1512784058, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1512784058, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1512784058, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1512784058} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1512784058, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1512784058, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1512784058, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-1512784058|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1512784058} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-27 07:04:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L793-->L794: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1498087925 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1498087925 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_Out-1498087925 ~y$r_buff0_thd2~0_In-1498087925)) (and (not .cse0) (= ~y$r_buff0_thd2~0_Out-1498087925 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1498087925, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1498087925} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1498087925, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1498087925, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out-1498087925|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-27 07:04:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1242] [1242] L794-->L794-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In1283542053 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1283542053 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd2~0_In1283542053 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In1283542053 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite60_Out1283542053| ~y$r_buff1_thd2~0_In1283542053) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork1_#t~ite60_Out1283542053|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1283542053, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1283542053, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1283542053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1283542053} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1283542053, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1283542053, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1283542053|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1283542053, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1283542053} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-27 07:04:09,329 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1276] [1276] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_58 |v_P1Thread1of1ForFork1_#t~ite60_8|)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_58, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:04:09,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1168] [1168] L819-->L821-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_142 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_51 256))) (not (= 0 (mod v_~main$tmp_guard0~0_6 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_142, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_142, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_51, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:04:09,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1241] [1241] L821-2-->L821-4: Formula: (let ((.cse1 (= (mod ~y$w_buff1_used~0_In-1070843019 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1070843019 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-1070843019| ~y~0_In-1070843019) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-1070843019| ~y$w_buff1~0_In-1070843019) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1070843019, ~y~0=~y~0_In-1070843019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1070843019, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1070843019} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-1070843019|, ~y$w_buff1~0=~y$w_buff1~0_In-1070843019, ~y~0=~y~0_In-1070843019, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1070843019, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1070843019} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-27 07:04:09,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1184] [1184] L821-4-->L822: Formula: (= v_~y~0_34 |v_ULTIMATE.start_main_#t~ite63_8|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_8|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_7|, ~y~0=v_~y~0_34, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 07:04:09,330 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1479914620 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1479914620 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite65_Out-1479914620| ~y$w_buff0_used~0_In-1479914620) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite65_Out-1479914620| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1479914620, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1479914620} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1479914620, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1479914620, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-1479914620|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 07:04:09,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1215] [1215] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In695351174 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In695351174 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In695351174 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In695351174 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite66_Out695351174|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~y$w_buff1_used~0_In695351174 |ULTIMATE.start_main_#t~ite66_Out695351174|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In695351174, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In695351174, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In695351174, ~y$w_buff1_used~0=~y$w_buff1_used~0_In695351174} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In695351174, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In695351174, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out695351174|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In695351174, ~y$w_buff1_used~0=~y$w_buff1_used~0_In695351174} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 07:04:09,331 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1229] [1229] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In143818979 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In143818979 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite67_Out143818979| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out143818979| ~y$r_buff0_thd0~0_In143818979) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In143818979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In143818979} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In143818979, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In143818979, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out143818979|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 07:04:09,332 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1221] [1221] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In333580919 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd0~0_In333580919 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In333580919 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In333580919 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out333580919|)) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In333580919 |ULTIMATE.start_main_#t~ite68_Out333580919|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In333580919, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In333580919, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In333580919, ~y$w_buff1_used~0=~y$w_buff1_used~0_In333580919} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In333580919, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In333580919, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out333580919|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In333580919, ~y$w_buff1_used~0=~y$w_buff1_used~0_In333580919} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 07:04:09,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1222] [1222] L840-->L840-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1758021985 256)))) (or (and (= ~y~0_In1758021985 |ULTIMATE.start_main_#t~ite91_Out1758021985|) .cse0) (and (= |ULTIMATE.start_main_#t~ite91_Out1758021985| ~y$mem_tmp~0_In1758021985) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1758021985, ~y$flush_delayed~0=~y$flush_delayed~0_In1758021985, ~y~0=~y~0_In1758021985} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1758021985, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1758021985|, ~y$flush_delayed~0=~y$flush_delayed~0_In1758021985, ~y~0=~y~0_In1758021985} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-27 07:04:09,340 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~y$flush_delayed~0_19) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_8 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~y~0_38 |v_ULTIMATE.start_main_#t~ite91_11|)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_10|, ~y$flush_delayed~0=v_~y$flush_delayed~0_19, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_38, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:04:09,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:04:09 BasicIcfg [2019-12-27 07:04:09,451 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:04:09,453 INFO L168 Benchmark]: Toolchain (without parser) took 42313.20 ms. Allocated memory was 143.1 MB in the beginning and 1.2 GB in the end (delta: 1.0 GB). Free memory was 99.7 MB in the beginning and 859.8 MB in the end (delta: -760.0 MB). Peak memory consumption was 277.5 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:09,453 INFO L168 Benchmark]: CDTParser took 0.68 ms. Allocated memory is still 143.1 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:04:09,454 INFO L168 Benchmark]: CACSL2BoogieTranslator took 836.60 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 151.5 MB in the end (delta: -52.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:09,454 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.01 ms. Allocated memory is still 200.3 MB. Free memory was 151.5 MB in the beginning and 147.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:09,455 INFO L168 Benchmark]: Boogie Preprocessor took 48.21 ms. Allocated memory is still 200.3 MB. Free memory was 147.4 MB in the beginning and 144.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:09,456 INFO L168 Benchmark]: RCFGBuilder took 1236.47 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 144.3 MB in the beginning and 193.0 MB in the end (delta: -48.7 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:09,456 INFO L168 Benchmark]: TraceAbstraction took 40103.86 ms. Allocated memory was 229.1 MB in the beginning and 1.2 GB in the end (delta: 951.6 MB). Free memory was 193.0 MB in the beginning and 859.8 MB in the end (delta: -666.7 MB). Peak memory consumption was 284.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:09,460 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.68 ms. Allocated memory is still 143.1 MB. Free memory is still 119.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 836.60 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 99.3 MB in the beginning and 151.5 MB in the end (delta: -52.2 MB). Peak memory consumption was 22.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.01 ms. Allocated memory is still 200.3 MB. Free memory was 151.5 MB in the beginning and 147.4 MB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.21 ms. Allocated memory is still 200.3 MB. Free memory was 147.4 MB in the beginning and 144.3 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1236.47 ms. Allocated memory was 200.3 MB in the beginning and 229.1 MB in the end (delta: 28.8 MB). Free memory was 144.3 MB in the beginning and 193.0 MB in the end (delta: -48.7 MB). Peak memory consumption was 69.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 40103.86 ms. Allocated memory was 229.1 MB in the beginning and 1.2 GB in the end (delta: 951.6 MB). Free memory was 193.0 MB in the beginning and 859.8 MB in the end (delta: -666.7 MB). Peak memory consumption was 284.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 231 ProgramPointsBefore, 149 ProgramPointsAfterwards, 307 TransitionsBefore, 187 TransitionsAfterwards, 40114 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 32 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 74 ConcurrentYvCompositions, 41 ChoiceCompositions, 15225 VarBasedMoverChecksPositive, 305 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 240611 CheckedPairsTotal, 135 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1597, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L815] FCALL, FORK 0 pthread_create(&t1598, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L730] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L744] 2 x = 2 [L747] 2 y$w_buff1 = y$w_buff0 [L748] 2 y$w_buff0 = 1 [L749] 2 y$w_buff1_used = y$w_buff0_used [L750] 2 y$w_buff0_used = (_Bool)1 [L762] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L763] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L763] 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)) [L764] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L764] 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)) [L765] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 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)) [L766] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L766] 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)) [L768] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L768] 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)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L778] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 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)) [L780] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L780] 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)) [L781] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L781] 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)) [L782] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L782] 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)) [L784] 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 [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L784] 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)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L730] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L731] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L732] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L733] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 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 [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 39.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4649 SDtfs, 7010 SDslu, 21668 SDs, 0 SdLazy, 14529 SolverSat, 456 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 312 GetRequests, 37 SyntacticMatches, 19 SemanticMatches, 256 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1436 ImplicationChecksByTransitivity, 6.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=51378occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.9s AutomataMinimizationTime, 17 MinimizatonAttempts, 14492 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 1199 NumberOfCodeBlocks, 1199 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1095 ConstructedInterpolants, 0 QuantifiedInterpolants, 539213 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...