/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/mix000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:59:14,936 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:59:14,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:59:14,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:59:14,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:59:14,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:59:14,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:59:14,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:59:14,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:59:14,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:59:14,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:59:14,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:59:14,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:59:14,961 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:59:14,961 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:59:14,963 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:59:14,963 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:59:14,964 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:59:14,966 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:59:14,968 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:59:14,969 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:59:14,970 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:59:14,971 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:59:14,972 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:59:14,974 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:59:14,975 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:59:14,975 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:59:14,976 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:59:14,976 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:59:14,977 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:59:14,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:59:14,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:59:14,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:59:14,980 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:59:14,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:59:14,981 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:59:14,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:59:14,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:59:14,982 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:59:14,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:59:14,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:59:14,985 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 04:59:14,999 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:59:14,999 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:59:15,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:59:15,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:59:15,001 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:59:15,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:59:15,001 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:59:15,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:59:15,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:59:15,002 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:59:15,002 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:59:15,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:59:15,002 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:59:15,002 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:59:15,003 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:59:15,003 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:59:15,003 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:59:15,003 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:59:15,003 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:59:15,004 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:59:15,004 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:59:15,004 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:59:15,004 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:59:15,004 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:59:15,005 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:59:15,005 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:59:15,005 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:59:15,005 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 04:59:15,005 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:59:15,005 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:59:15,253 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:59:15,271 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:59:15,275 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:59:15,276 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:59:15,276 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:59:15,277 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-27 04:59:15,349 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a990d65/8f33bcd4e656418489f291376ed80266/FLAGedfcaac1a [2019-12-27 04:59:15,855 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:59:15,858 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix000_rmo.oepc.i [2019-12-27 04:59:15,877 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a990d65/8f33bcd4e656418489f291376ed80266/FLAGedfcaac1a [2019-12-27 04:59:16,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66a990d65/8f33bcd4e656418489f291376ed80266 [2019-12-27 04:59:16,119 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:59:16,121 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:59:16,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:59:16,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:59:16,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:59:16,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:16,130 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c9fdd1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16, skipping insertion in model container [2019-12-27 04:59:16,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:16,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:59:16,181 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:59:16,734 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:59:16,759 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:59:16,830 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:59:16,915 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:59:16,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16 WrapperNode [2019-12-27 04:59:16,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:59:16,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:59:16,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:59:16,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:59:16,927 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:16,948 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:17,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:59:17,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:59:17,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:59:17,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:59:17,027 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:17,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:17,042 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:17,042 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:17,068 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:17,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:17,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (1/1) ... [2019-12-27 04:59:17,096 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:59:17,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:59:17,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:59:17,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:59:17,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (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 04:59:17,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:59:17,160 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 04:59:17,161 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:59:17,161 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:59:17,161 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 04:59:17,161 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 04:59:17,161 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 04:59:17,162 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 04:59:17,162 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 04:59:17,163 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:59:17,163 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:59:17,165 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 04:59:18,058 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:59:18,059 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 04:59:18,060 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:59:18 BoogieIcfgContainer [2019-12-27 04:59:18,060 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:59:18,063 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:59:18,063 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:59:18,066 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:59:18,067 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:59:16" (1/3) ... [2019-12-27 04:59:18,068 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8759750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:59:18, skipping insertion in model container [2019-12-27 04:59:18,068 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:59:16" (2/3) ... [2019-12-27 04:59:18,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8759750 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:59:18, skipping insertion in model container [2019-12-27 04:59:18,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:59:18" (3/3) ... [2019-12-27 04:59:18,072 INFO L109 eAbstractionObserver]: Analyzing ICFG mix000_rmo.oepc.i [2019-12-27 04:59:18,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:59:18,083 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:59:18,095 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 04:59:18,096 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:59:18,162 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,163 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,163 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,164 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,164 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,165 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,165 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,166 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,167 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,168 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,169 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,170 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,171 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,172 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,173 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,174 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,175 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,215 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,216 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,217 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,218 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,219 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,220 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,221 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,222 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,223 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,224 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,225 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,226 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,227 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,232 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,233 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,238 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,239 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,240 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,241 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,247 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,288 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,289 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,290 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,290 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,291 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,292 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,293 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,293 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,294 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,299 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,300 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,300 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,301 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,301 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,302 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,303 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,304 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,305 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,305 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,306 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:59:18,322 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 04:59:18,346 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:59:18,346 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:59:18,346 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:59:18,346 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:59:18,346 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:59:18,346 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:59:18,347 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:59:18,347 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:59:18,367 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 191 places, 246 transitions [2019-12-27 04:59:18,369 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 04:59:18,532 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 04:59:18,533 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:59:18,554 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 04:59:18,584 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 191 places, 246 transitions [2019-12-27 04:59:18,649 INFO L132 PetriNetUnfolder]: 62/244 cut-off events. [2019-12-27 04:59:18,650 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 04:59:18,663 INFO L76 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 244 events. 62/244 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 630 event pairs. 0/180 useless extension candidates. Maximal degree in co-relation 213. Up to 2 conditions per place. [2019-12-27 04:59:18,697 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 27428 [2019-12-27 04:59:18,698 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 04:59:21,871 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 04:59:22,000 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 04:59:22,054 INFO L206 etLargeBlockEncoding]: Checked pairs total: 156567 [2019-12-27 04:59:22,055 INFO L214 etLargeBlockEncoding]: Total number of compositions: 110 [2019-12-27 04:59:22,058 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 116 places, 141 transitions [2019-12-27 04:59:24,077 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 31650 states. [2019-12-27 04:59:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 31650 states. [2019-12-27 04:59:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 04:59:24,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:24,087 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 04:59:24,087 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:24,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:24,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1078912, now seen corresponding path program 1 times [2019-12-27 04:59:24,104 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:24,104 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63423766] [2019-12-27 04:59:24,105 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:24,343 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 04:59:24,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63423766] [2019-12-27 04:59:24,345 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:24,345 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 04:59:24,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243781557] [2019-12-27 04:59:24,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:24,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:24,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:24,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:24,367 INFO L87 Difference]: Start difference. First operand 31650 states. Second operand 3 states. [2019-12-27 04:59:24,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:24,856 INFO L93 Difference]: Finished difference Result 31498 states and 111612 transitions. [2019-12-27 04:59:24,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:24,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 04:59:24,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:25,114 INFO L225 Difference]: With dead ends: 31498 [2019-12-27 04:59:25,114 INFO L226 Difference]: Without dead ends: 29342 [2019-12-27 04:59:25,116 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 04:59:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29342 states. [2019-12-27 04:59:27,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29342 to 29342. [2019-12-27 04:59:27,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29342 states. [2019-12-27 04:59:27,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29342 states to 29342 states and 103886 transitions. [2019-12-27 04:59:27,705 INFO L78 Accepts]: Start accepts. Automaton has 29342 states and 103886 transitions. Word has length 3 [2019-12-27 04:59:27,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:27,705 INFO L462 AbstractCegarLoop]: Abstraction has 29342 states and 103886 transitions. [2019-12-27 04:59:27,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 29342 states and 103886 transitions. [2019-12-27 04:59:27,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 04:59:27,715 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:27,715 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:27,715 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:27,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:27,716 INFO L82 PathProgramCache]: Analyzing trace with hash 559991540, now seen corresponding path program 1 times [2019-12-27 04:59:27,716 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:27,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112821373] [2019-12-27 04:59:27,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:27,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:27,832 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 04:59:27,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112821373] [2019-12-27 04:59:27,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:27,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:59:27,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427248388] [2019-12-27 04:59:27,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:27,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:27,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:27,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:27,836 INFO L87 Difference]: Start difference. First operand 29342 states and 103886 transitions. Second operand 3 states. [2019-12-27 04:59:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:27,891 INFO L93 Difference]: Finished difference Result 3451 states and 8567 transitions. [2019-12-27 04:59:27,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:27,891 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 04:59:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:27,900 INFO L225 Difference]: With dead ends: 3451 [2019-12-27 04:59:27,901 INFO L226 Difference]: Without dead ends: 3451 [2019-12-27 04:59:27,901 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 04:59:27,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3451 states. [2019-12-27 04:59:27,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3451 to 3451. [2019-12-27 04:59:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3451 states. [2019-12-27 04:59:27,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3451 states to 3451 states and 8567 transitions. [2019-12-27 04:59:27,981 INFO L78 Accepts]: Start accepts. Automaton has 3451 states and 8567 transitions. Word has length 11 [2019-12-27 04:59:27,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:27,981 INFO L462 AbstractCegarLoop]: Abstraction has 3451 states and 8567 transitions. [2019-12-27 04:59:27,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:27,981 INFO L276 IsEmpty]: Start isEmpty. Operand 3451 states and 8567 transitions. [2019-12-27 04:59:27,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:59:27,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:27,984 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:27,984 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:27,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:27,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1482577634, now seen corresponding path program 1 times [2019-12-27 04:59:27,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:27,985 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636909568] [2019-12-27 04:59:27,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:28,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 04:59:28,090 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636909568] [2019-12-27 04:59:28,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:28,090 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:59:28,092 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789320414] [2019-12-27 04:59:28,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:28,093 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:28,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:28,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:28,093 INFO L87 Difference]: Start difference. First operand 3451 states and 8567 transitions. Second operand 4 states. [2019-12-27 04:59:28,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:28,873 INFO L93 Difference]: Finished difference Result 4533 states and 11006 transitions. [2019-12-27 04:59:28,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:59:28,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 04:59:28,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:28,891 INFO L225 Difference]: With dead ends: 4533 [2019-12-27 04:59:28,891 INFO L226 Difference]: Without dead ends: 4533 [2019-12-27 04:59:28,892 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 04:59:28,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2019-12-27 04:59:28,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4465. [2019-12-27 04:59:28,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4465 states. [2019-12-27 04:59:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 10874 transitions. [2019-12-27 04:59:28,985 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 10874 transitions. Word has length 14 [2019-12-27 04:59:28,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:28,986 INFO L462 AbstractCegarLoop]: Abstraction has 4465 states and 10874 transitions. [2019-12-27 04:59:28,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:28,986 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 10874 transitions. [2019-12-27 04:59:28,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:59:28,987 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:28,988 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:28,988 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:28,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:28,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1284762389, now seen corresponding path program 1 times [2019-12-27 04:59:28,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:28,989 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119299315] [2019-12-27 04:59:28,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:29,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:29,053 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 04:59:29,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119299315] [2019-12-27 04:59:29,056 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:29,057 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:29,057 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615941334] [2019-12-27 04:59:29,057 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:29,057 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:29,058 INFO L87 Difference]: Start difference. First operand 4465 states and 10874 transitions. Second operand 3 states. [2019-12-27 04:59:29,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:29,153 INFO L93 Difference]: Finished difference Result 7903 states and 18336 transitions. [2019-12-27 04:59:29,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:29,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 04:59:29,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:29,175 INFO L225 Difference]: With dead ends: 7903 [2019-12-27 04:59:29,175 INFO L226 Difference]: Without dead ends: 7903 [2019-12-27 04:59:29,175 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 04:59:29,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2019-12-27 04:59:29,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 6842. [2019-12-27 04:59:29,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6842 states. [2019-12-27 04:59:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6842 states to 6842 states and 16113 transitions. [2019-12-27 04:59:29,320 INFO L78 Accepts]: Start accepts. Automaton has 6842 states and 16113 transitions. Word has length 15 [2019-12-27 04:59:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:29,320 INFO L462 AbstractCegarLoop]: Abstraction has 6842 states and 16113 transitions. [2019-12-27 04:59:29,320 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 6842 states and 16113 transitions. [2019-12-27 04:59:29,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:59:29,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:29,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:29,323 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:29,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:29,323 INFO L82 PathProgramCache]: Analyzing trace with hash 1823214846, now seen corresponding path program 1 times [2019-12-27 04:59:29,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:29,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721731433] [2019-12-27 04:59:29,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:29,373 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 04:59:29,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721731433] [2019-12-27 04:59:29,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:29,374 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:59:29,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967634826] [2019-12-27 04:59:29,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:29,375 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:29,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:29,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:29,376 INFO L87 Difference]: Start difference. First operand 6842 states and 16113 transitions. Second operand 4 states. [2019-12-27 04:59:29,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:29,676 INFO L93 Difference]: Finished difference Result 8322 states and 19313 transitions. [2019-12-27 04:59:29,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 04:59:29,676 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 04:59:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:29,701 INFO L225 Difference]: With dead ends: 8322 [2019-12-27 04:59:29,702 INFO L226 Difference]: Without dead ends: 8322 [2019-12-27 04:59:29,702 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 04:59:29,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8322 states. [2019-12-27 04:59:29,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8322 to 6895. [2019-12-27 04:59:29,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6895 states. [2019-12-27 04:59:29,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6895 states to 6895 states and 16226 transitions. [2019-12-27 04:59:29,848 INFO L78 Accepts]: Start accepts. Automaton has 6895 states and 16226 transitions. Word has length 17 [2019-12-27 04:59:29,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:29,848 INFO L462 AbstractCegarLoop]: Abstraction has 6895 states and 16226 transitions. [2019-12-27 04:59:29,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:29,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6895 states and 16226 transitions. [2019-12-27 04:59:29,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 04:59:29,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:29,854 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] [2019-12-27 04:59:29,854 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:29,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:29,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1246091973, now seen corresponding path program 1 times [2019-12-27 04:59:29,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:29,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186199939] [2019-12-27 04:59:29,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:29,926 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 04:59:29,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186199939] [2019-12-27 04:59:29,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:29,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:29,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894507084] [2019-12-27 04:59:29,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:59:29,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:29,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:59:29,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:29,928 INFO L87 Difference]: Start difference. First operand 6895 states and 16226 transitions. Second operand 5 states. [2019-12-27 04:59:30,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:30,448 INFO L93 Difference]: Finished difference Result 9279 states and 21293 transitions. [2019-12-27 04:59:30,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:59:30,449 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 04:59:30,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:30,473 INFO L225 Difference]: With dead ends: 9279 [2019-12-27 04:59:30,473 INFO L226 Difference]: Without dead ends: 9279 [2019-12-27 04:59:30,474 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:59:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9279 states. [2019-12-27 04:59:30,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9279 to 8842. [2019-12-27 04:59:30,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8842 states. [2019-12-27 04:59:30,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8842 states to 8842 states and 20427 transitions. [2019-12-27 04:59:30,648 INFO L78 Accepts]: Start accepts. Automaton has 8842 states and 20427 transitions. Word has length 27 [2019-12-27 04:59:30,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:30,648 INFO L462 AbstractCegarLoop]: Abstraction has 8842 states and 20427 transitions. [2019-12-27 04:59:30,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:59:30,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8842 states and 20427 transitions. [2019-12-27 04:59:30,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 04:59:30,656 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:30,656 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] [2019-12-27 04:59:30,656 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:30,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:30,656 INFO L82 PathProgramCache]: Analyzing trace with hash -326843675, now seen corresponding path program 1 times [2019-12-27 04:59:30,657 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:30,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904032445] [2019-12-27 04:59:30,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:30,713 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 04:59:30,713 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904032445] [2019-12-27 04:59:30,713 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:30,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:30,715 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129657553] [2019-12-27 04:59:30,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:30,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:30,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:30,716 INFO L87 Difference]: Start difference. First operand 8842 states and 20427 transitions. Second operand 3 states. [2019-12-27 04:59:30,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:30,816 INFO L93 Difference]: Finished difference Result 9983 states and 21907 transitions. [2019-12-27 04:59:30,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:30,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-27 04:59:30,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:30,836 INFO L225 Difference]: With dead ends: 9983 [2019-12-27 04:59:30,836 INFO L226 Difference]: Without dead ends: 9983 [2019-12-27 04:59:30,837 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 04:59:30,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9983 states. [2019-12-27 04:59:31,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9983 to 8811. [2019-12-27 04:59:31,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8811 states. [2019-12-27 04:59:31,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8811 states to 8811 states and 19466 transitions. [2019-12-27 04:59:31,034 INFO L78 Accepts]: Start accepts. Automaton has 8811 states and 19466 transitions. Word has length 30 [2019-12-27 04:59:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:31,034 INFO L462 AbstractCegarLoop]: Abstraction has 8811 states and 19466 transitions. [2019-12-27 04:59:31,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:31,035 INFO L276 IsEmpty]: Start isEmpty. Operand 8811 states and 19466 transitions. [2019-12-27 04:59:31,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 04:59:31,047 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:31,047 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:59:31,048 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:31,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:31,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1451833890, now seen corresponding path program 1 times [2019-12-27 04:59:31,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:31,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822003919] [2019-12-27 04:59:31,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:31,174 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 04:59:31,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822003919] [2019-12-27 04:59:31,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:31,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:31,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279902865] [2019-12-27 04:59:31,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:59:31,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:31,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:59:31,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:31,177 INFO L87 Difference]: Start difference. First operand 8811 states and 19466 transitions. Second operand 5 states. [2019-12-27 04:59:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:31,650 INFO L93 Difference]: Finished difference Result 9934 states and 21689 transitions. [2019-12-27 04:59:31,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:59:31,651 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-27 04:59:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:31,664 INFO L225 Difference]: With dead ends: 9934 [2019-12-27 04:59:31,665 INFO L226 Difference]: Without dead ends: 9934 [2019-12-27 04:59:31,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:59:31,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9934 states. [2019-12-27 04:59:31,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9934 to 7897. [2019-12-27 04:59:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7897 states. [2019-12-27 04:59:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7897 states to 7897 states and 17615 transitions. [2019-12-27 04:59:31,878 INFO L78 Accepts]: Start accepts. Automaton has 7897 states and 17615 transitions. Word has length 33 [2019-12-27 04:59:31,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:31,881 INFO L462 AbstractCegarLoop]: Abstraction has 7897 states and 17615 transitions. [2019-12-27 04:59:31,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:59:31,882 INFO L276 IsEmpty]: Start isEmpty. Operand 7897 states and 17615 transitions. [2019-12-27 04:59:31,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 04:59:31,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:31,896 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] [2019-12-27 04:59:31,896 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:31,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:31,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1521082095, now seen corresponding path program 1 times [2019-12-27 04:59:31,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:31,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404573198] [2019-12-27 04:59:31,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:31,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:31,978 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 04:59:31,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404573198] [2019-12-27 04:59:31,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:31,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:31,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813410224] [2019-12-27 04:59:31,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:31,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:31,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:31,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:31,982 INFO L87 Difference]: Start difference. First operand 7897 states and 17615 transitions. Second operand 4 states. [2019-12-27 04:59:32,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:32,021 INFO L93 Difference]: Finished difference Result 5532 states and 12270 transitions. [2019-12-27 04:59:32,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:59:32,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 04:59:32,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:32,032 INFO L225 Difference]: With dead ends: 5532 [2019-12-27 04:59:32,032 INFO L226 Difference]: Without dead ends: 5532 [2019-12-27 04:59:32,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5532 states. [2019-12-27 04:59:32,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5532 to 5428. [2019-12-27 04:59:32,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5428 states. [2019-12-27 04:59:32,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5428 states to 5428 states and 12077 transitions. [2019-12-27 04:59:32,162 INFO L78 Accepts]: Start accepts. Automaton has 5428 states and 12077 transitions. Word has length 39 [2019-12-27 04:59:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:32,163 INFO L462 AbstractCegarLoop]: Abstraction has 5428 states and 12077 transitions. [2019-12-27 04:59:32,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 5428 states and 12077 transitions. [2019-12-27 04:59:32,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 04:59:32,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:32,184 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] [2019-12-27 04:59:32,184 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash -180233684, now seen corresponding path program 1 times [2019-12-27 04:59:32,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:32,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458077028] [2019-12-27 04:59:32,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:32,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:32,382 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 04:59:32,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458077028] [2019-12-27 04:59:32,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:32,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:59:32,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160368106] [2019-12-27 04:59:32,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:59:32,384 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:32,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:59:32,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:59:32,385 INFO L87 Difference]: Start difference. First operand 5428 states and 12077 transitions. Second operand 8 states. [2019-12-27 04:59:32,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:32,845 INFO L93 Difference]: Finished difference Result 10275 states and 22585 transitions. [2019-12-27 04:59:32,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 04:59:32,846 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-27 04:59:32,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:32,856 INFO L225 Difference]: With dead ends: 10275 [2019-12-27 04:59:32,856 INFO L226 Difference]: Without dead ends: 9146 [2019-12-27 04:59:32,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=163, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:59:32,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9146 states. [2019-12-27 04:59:32,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9146 to 6812. [2019-12-27 04:59:32,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6812 states. [2019-12-27 04:59:33,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6812 states to 6812 states and 15382 transitions. [2019-12-27 04:59:33,001 INFO L78 Accepts]: Start accepts. Automaton has 6812 states and 15382 transitions. Word has length 68 [2019-12-27 04:59:33,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:33,002 INFO L462 AbstractCegarLoop]: Abstraction has 6812 states and 15382 transitions. [2019-12-27 04:59:33,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:59:33,002 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states and 15382 transitions. [2019-12-27 04:59:33,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 04:59:33,021 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:33,021 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] [2019-12-27 04:59:33,022 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:33,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:33,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1054499084, now seen corresponding path program 2 times [2019-12-27 04:59:33,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:33,022 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916552801] [2019-12-27 04:59:33,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:33,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:33,123 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 04:59:33,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916552801] [2019-12-27 04:59:33,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:33,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:33,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56459983] [2019-12-27 04:59:33,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 04:59:33,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:33,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 04:59:33,125 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 04:59:33,125 INFO L87 Difference]: Start difference. First operand 6812 states and 15382 transitions. Second operand 5 states. [2019-12-27 04:59:33,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:33,266 INFO L93 Difference]: Finished difference Result 9900 states and 22320 transitions. [2019-12-27 04:59:33,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 04:59:33,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-12-27 04:59:33,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:33,277 INFO L225 Difference]: With dead ends: 9900 [2019-12-27 04:59:33,277 INFO L226 Difference]: Without dead ends: 8364 [2019-12-27 04:59:33,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:59:33,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8364 states. [2019-12-27 04:59:33,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8364 to 8264. [2019-12-27 04:59:33,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8264 states. [2019-12-27 04:59:33,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8264 states to 8264 states and 18802 transitions. [2019-12-27 04:59:33,436 INFO L78 Accepts]: Start accepts. Automaton has 8264 states and 18802 transitions. Word has length 68 [2019-12-27 04:59:33,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:33,436 INFO L462 AbstractCegarLoop]: Abstraction has 8264 states and 18802 transitions. [2019-12-27 04:59:33,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 04:59:33,436 INFO L276 IsEmpty]: Start isEmpty. Operand 8264 states and 18802 transitions. [2019-12-27 04:59:33,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 04:59:33,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:33,505 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] [2019-12-27 04:59:33,505 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:33,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash 283351324, now seen corresponding path program 3 times [2019-12-27 04:59:33,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:33,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057900324] [2019-12-27 04:59:33,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:33,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:33,616 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 04:59:33,616 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057900324] [2019-12-27 04:59:33,616 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:33,616 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:59:33,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023216291] [2019-12-27 04:59:33,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:59:33,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:33,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:59:33,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:59:33,618 INFO L87 Difference]: Start difference. First operand 8264 states and 18802 transitions. Second operand 8 states. [2019-12-27 04:59:34,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:34,052 INFO L93 Difference]: Finished difference Result 12633 states and 28391 transitions. [2019-12-27 04:59:34,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:59:34,052 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 68 [2019-12-27 04:59:34,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:34,066 INFO L225 Difference]: With dead ends: 12633 [2019-12-27 04:59:34,066 INFO L226 Difference]: Without dead ends: 12150 [2019-12-27 04:59:34,067 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:59:34,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12150 states. [2019-12-27 04:59:34,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12150 to 8320. [2019-12-27 04:59:34,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8320 states. [2019-12-27 04:59:34,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8320 states to 8320 states and 18925 transitions. [2019-12-27 04:59:34,202 INFO L78 Accepts]: Start accepts. Automaton has 8320 states and 18925 transitions. Word has length 68 [2019-12-27 04:59:34,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:34,203 INFO L462 AbstractCegarLoop]: Abstraction has 8320 states and 18925 transitions. [2019-12-27 04:59:34,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:59:34,203 INFO L276 IsEmpty]: Start isEmpty. Operand 8320 states and 18925 transitions. [2019-12-27 04:59:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 04:59:34,222 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:34,222 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] [2019-12-27 04:59:34,223 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:34,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:34,223 INFO L82 PathProgramCache]: Analyzing trace with hash 741146474, now seen corresponding path program 4 times [2019-12-27 04:59:34,223 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:34,223 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962187479] [2019-12-27 04:59:34,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:34,307 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 04:59:34,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962187479] [2019-12-27 04:59:34,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:34,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:59:34,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136247954] [2019-12-27 04:59:34,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:59:34,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:34,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:59:34,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:59:34,309 INFO L87 Difference]: Start difference. First operand 8320 states and 18925 transitions. Second operand 6 states. [2019-12-27 04:59:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:34,527 INFO L93 Difference]: Finished difference Result 14353 states and 32381 transitions. [2019-12-27 04:59:34,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 04:59:34,527 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-27 04:59:34,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:34,542 INFO L225 Difference]: With dead ends: 14353 [2019-12-27 04:59:34,543 INFO L226 Difference]: Without dead ends: 12179 [2019-12-27 04:59:34,543 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:59:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12179 states. [2019-12-27 04:59:34,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12179 to 9546. [2019-12-27 04:59:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9546 states. [2019-12-27 04:59:34,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9546 states to 9546 states and 21681 transitions. [2019-12-27 04:59:34,694 INFO L78 Accepts]: Start accepts. Automaton has 9546 states and 21681 transitions. Word has length 68 [2019-12-27 04:59:34,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:34,694 INFO L462 AbstractCegarLoop]: Abstraction has 9546 states and 21681 transitions. [2019-12-27 04:59:34,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:59:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 9546 states and 21681 transitions. [2019-12-27 04:59:34,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 04:59:34,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:34,712 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] [2019-12-27 04:59:34,712 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:34,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:34,712 INFO L82 PathProgramCache]: Analyzing trace with hash -439547742, now seen corresponding path program 5 times [2019-12-27 04:59:34,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:34,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384364920] [2019-12-27 04:59:34,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:34,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:34,783 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 04:59:34,784 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384364920] [2019-12-27 04:59:34,784 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:34,784 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:34,784 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624707748] [2019-12-27 04:59:34,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:34,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:34,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:34,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:34,785 INFO L87 Difference]: Start difference. First operand 9546 states and 21681 transitions. Second operand 4 states. [2019-12-27 04:59:34,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:34,833 INFO L93 Difference]: Finished difference Result 10263 states and 23212 transitions. [2019-12-27 04:59:34,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:59:34,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-12-27 04:59:34,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:34,835 INFO L225 Difference]: With dead ends: 10263 [2019-12-27 04:59:34,835 INFO L226 Difference]: Without dead ends: 909 [2019-12-27 04:59:34,835 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 04:59:34,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2019-12-27 04:59:34,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 909. [2019-12-27 04:59:34,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 909 states. [2019-12-27 04:59:34,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 909 states to 909 states and 1891 transitions. [2019-12-27 04:59:34,847 INFO L78 Accepts]: Start accepts. Automaton has 909 states and 1891 transitions. Word has length 68 [2019-12-27 04:59:34,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:34,847 INFO L462 AbstractCegarLoop]: Abstraction has 909 states and 1891 transitions. [2019-12-27 04:59:34,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:34,847 INFO L276 IsEmpty]: Start isEmpty. Operand 909 states and 1891 transitions. [2019-12-27 04:59:34,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-27 04:59:34,849 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:34,850 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] [2019-12-27 04:59:34,850 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:34,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:34,850 INFO L82 PathProgramCache]: Analyzing trace with hash -1610368982, now seen corresponding path program 1 times [2019-12-27 04:59:34,850 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:34,851 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746290013] [2019-12-27 04:59:34,851 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:34,966 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 04:59:34,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746290013] [2019-12-27 04:59:34,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:34,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:59:34,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701217402] [2019-12-27 04:59:34,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 04:59:34,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:34,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 04:59:34,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 04:59:34,969 INFO L87 Difference]: Start difference. First operand 909 states and 1891 transitions. Second operand 4 states. [2019-12-27 04:59:35,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:35,067 INFO L93 Difference]: Finished difference Result 1030 states and 2133 transitions. [2019-12-27 04:59:35,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 04:59:35,067 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-27 04:59:35,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:35,069 INFO L225 Difference]: With dead ends: 1030 [2019-12-27 04:59:35,069 INFO L226 Difference]: Without dead ends: 1030 [2019-12-27 04:59:35,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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 04:59:35,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1030 states. [2019-12-27 04:59:35,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1030 to 942. [2019-12-27 04:59:35,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 942 states. [2019-12-27 04:59:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1957 transitions. [2019-12-27 04:59:35,087 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1957 transitions. Word has length 69 [2019-12-27 04:59:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:35,087 INFO L462 AbstractCegarLoop]: Abstraction has 942 states and 1957 transitions. [2019-12-27 04:59:35,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 04:59:35,088 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1957 transitions. [2019-12-27 04:59:35,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 04:59:35,091 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:35,091 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] [2019-12-27 04:59:35,091 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:35,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:35,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1855866882, now seen corresponding path program 1 times [2019-12-27 04:59:35,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:35,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26720691] [2019-12-27 04:59:35,093 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:35,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:35,321 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 04:59:35,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26720691] [2019-12-27 04:59:35,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:35,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:59:35,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61107479] [2019-12-27 04:59:35,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:59:35,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:35,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:59:35,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:59:35,323 INFO L87 Difference]: Start difference. First operand 942 states and 1957 transitions. Second operand 10 states. [2019-12-27 04:59:36,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:36,143 INFO L93 Difference]: Finished difference Result 1534 states and 3016 transitions. [2019-12-27 04:59:36,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:59:36,143 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2019-12-27 04:59:36,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:36,146 INFO L225 Difference]: With dead ends: 1534 [2019-12-27 04:59:36,146 INFO L226 Difference]: Without dead ends: 1510 [2019-12-27 04:59:36,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:59:36,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1510 states. [2019-12-27 04:59:36,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1510 to 1313. [2019-12-27 04:59:36,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-12-27 04:59:36,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 2622 transitions. [2019-12-27 04:59:36,162 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 2622 transitions. Word has length 70 [2019-12-27 04:59:36,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:36,162 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 2622 transitions. [2019-12-27 04:59:36,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:59:36,163 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 2622 transitions. [2019-12-27 04:59:36,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 04:59:36,165 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:36,165 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] [2019-12-27 04:59:36,166 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:36,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:36,166 INFO L82 PathProgramCache]: Analyzing trace with hash 1395207600, now seen corresponding path program 2 times [2019-12-27 04:59:36,166 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:36,166 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086309640] [2019-12-27 04:59:36,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:36,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:59:36,244 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 04:59:36,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086309640] [2019-12-27 04:59:36,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:59:36,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:59:36,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458697611] [2019-12-27 04:59:36,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:59:36,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:59:36,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:59:36,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:59:36,248 INFO L87 Difference]: Start difference. First operand 1313 states and 2622 transitions. Second operand 3 states. [2019-12-27 04:59:36,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:59:36,263 INFO L93 Difference]: Finished difference Result 1313 states and 2621 transitions. [2019-12-27 04:59:36,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:59:36,264 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 04:59:36,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:59:36,265 INFO L225 Difference]: With dead ends: 1313 [2019-12-27 04:59:36,266 INFO L226 Difference]: Without dead ends: 1313 [2019-12-27 04:59:36,266 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 04:59:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-12-27 04:59:36,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1135. [2019-12-27 04:59:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1135 states. [2019-12-27 04:59:36,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 2293 transitions. [2019-12-27 04:59:36,286 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 2293 transitions. Word has length 70 [2019-12-27 04:59:36,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:59:36,286 INFO L462 AbstractCegarLoop]: Abstraction has 1135 states and 2293 transitions. [2019-12-27 04:59:36,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:59:36,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 2293 transitions. [2019-12-27 04:59:36,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 04:59:36,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:59:36,289 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] [2019-12-27 04:59:36,290 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 04:59:36,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:59:36,290 INFO L82 PathProgramCache]: Analyzing trace with hash 309404191, now seen corresponding path program 1 times [2019-12-27 04:59:36,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:59:36,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703201207] [2019-12-27 04:59:36,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:59:36,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:59:36,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 04:59:36,445 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 04:59:36,445 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 04:59:36,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t6~0.base_23|) |v_ULTIMATE.start_main_~#t6~0.offset_18| 0)) |v_#memory_int_17|) (= v_~y$w_buff1_used~0_73 0) (= 0 v_~__unbuffered_p0_EAX~0_13) (= 0 v_~y$read_delayed_var~0.offset_7) (= 0 v_~y$r_buff1_thd0~0_23) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t6~0.base_23| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t6~0.base_23|) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p1_EAX~0_12) (= |v_#NULL.offset_6| 0) (= v_~y$r_buff0_thd1~0_79 0) (= v_~y$read_delayed~0_4 0) (= |v_ULTIMATE.start_main_~#t6~0.offset_18| 0) (= 0 v_~__unbuffered_cnt~0_17) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t6~0.base_23|)) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~weak$$choice2~0_36) (= v_~y$r_buff0_thd2~0_63 0) (= v_~y$r_buff0_thd0~0_19 0) (= v_~y$w_buff0_used~0_136 0) (= 0 v_~y$flush_delayed~0_18) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~y$r_buff1_thd1~0_40) (= v_~y~0_32 0) (= v_~y$mem_tmp~0_14 0) (= v_~main$tmp_guard1~0_14 0) (= v_~__unbuffered_p0_EBX~0_12 0) (= 0 v_~y$w_buff1~0_32) (= (store .cse0 |v_ULTIMATE.start_main_~#t6~0.base_23| 1) |v_#valid_46|) (= v_~__unbuffered_p1_EBX~0_13 0) (= 0 v_~y$r_buff1_thd2~0_38) (= 0 v_~y$w_buff0~0_34) (= 0 v_~x~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_136, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_16|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_19|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_11|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_11|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_11|, ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_19|, ~y$read_delayed~0=v_~y$read_delayed~0_4, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_40, ULTIMATE.start_main_~#t6~0.offset=|v_ULTIMATE.start_main_~#t6~0.offset_18|, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_13, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_12, ~y$w_buff0~0=v_~y$w_buff0~0_34, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_79, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_17|, ~y~0=v_~y~0_32, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_9|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_9|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_38, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_13|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_19, #valid=|v_#valid_46|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_63, #memory_int=|v_#memory_int_17|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_~#t6~0.base=|v_ULTIMATE.start_main_~#t6~0.base_23|, ~weak$$choice2~0=v_~weak$$choice2~0_36, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_23, ~x~0=v_~x~0_8, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_73} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_~#t7~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_~#t7~0.base, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ULTIMATE.start_main_~#t6~0.offset, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_#t~nondet62, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, #NULL.base, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t6~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 04:59:36,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1043] [1043] L5-->L744: Formula: (and (= ~y$r_buff0_thd1~0_In1420350959 ~y$r_buff1_thd1~0_Out1420350959) (= ~weak$$choice2~0_Out1420350959 ~y$flush_delayed~0_Out1420350959) (= ~y$mem_tmp~0_Out1420350959 ~y~0_In1420350959) (= 1 ~y$r_buff0_thd1~0_Out1420350959) (= |P0Thread1of1ForFork1_#t~nondet3_In1420350959| ~weak$$choice0~0_Out1420350959) (= ~y$r_buff1_thd0~0_Out1420350959 ~y$r_buff0_thd0~0_In1420350959) (= ~y$r_buff1_thd2~0_Out1420350959 ~y$r_buff0_thd2~0_In1420350959) (= |P0Thread1of1ForFork1_#t~nondet4_In1420350959| ~weak$$choice2~0_Out1420350959) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1420350959))) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1420350959, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1420350959, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1420350959, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1420350959, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_In1420350959|, ~y~0=~y~0_In1420350959, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_In1420350959|} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out1420350959, ~weak$$choice0~0=~weak$$choice0~0_Out1420350959, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out1420350959, ~y$mem_tmp~0=~y$mem_tmp~0_Out1420350959, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1420350959, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1420350959, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1420350959, ~y$flush_delayed~0=~y$flush_delayed~0_Out1420350959, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1420350959, P0Thread1of1ForFork1_#t~nondet3=|P0Thread1of1ForFork1_#t~nondet3_Out1420350959|, ~y~0=~y~0_In1420350959, ~weak$$choice2~0=~weak$$choice2~0_Out1420350959, P0Thread1of1ForFork1_#t~nondet4=|P0Thread1of1ForFork1_#t~nondet4_Out1420350959|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out1420350959} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, P0Thread1of1ForFork1_#t~nondet3, ~weak$$choice2~0, P0Thread1of1ForFork1_#t~nondet4, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 04:59:36,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1036] [1036] L818-1-->L820: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t7~0.offset_10|) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t7~0.base_11| 4)) (not (= 0 |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= 0 (select |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11|)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t7~0.base_11|) |v_ULTIMATE.start_main_~#t7~0.offset_10| 1)) |v_#memory_int_9|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t7~0.base_11| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t7~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_10|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t7~0.base=|v_ULTIMATE.start_main_~#t7~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_~#t7~0.offset=|v_ULTIMATE.start_main_~#t7~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_9|, #length=|v_#length_9|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t7~0.base, ULTIMATE.start_main_~#t7~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-27 04:59:36,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1021] [1021] L744-2-->L744-5: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-372908485 256))) (.cse0 (= (mod ~y$r_buff0_thd1~0_In-372908485 256) 0)) (.cse2 (= |P0Thread1of1ForFork1_#t~ite6_Out-372908485| |P0Thread1of1ForFork1_#t~ite5_Out-372908485|))) (or (and (not .cse0) (= ~y$w_buff0~0_In-372908485 |P0Thread1of1ForFork1_#t~ite5_Out-372908485|) (not .cse1) .cse2) (and (or .cse1 .cse0) .cse2 (= ~y$w_buff1~0_In-372908485 |P0Thread1of1ForFork1_#t~ite5_Out-372908485|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-372908485, ~y$w_buff1~0=~y$w_buff1~0_In-372908485, ~y$w_buff0~0=~y$w_buff0~0_In-372908485, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-372908485} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-372908485|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-372908485, ~y$w_buff1~0=~y$w_buff1~0_In-372908485, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-372908485|, ~y$w_buff0~0=~y$w_buff0~0_In-372908485, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-372908485} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5, P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 04:59:36,461 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L749-->L750: Formula: (and (not (= (mod v_~weak$$choice2~0_28 256) 0)) (= v_~y$r_buff0_thd1~0_49 v_~y$r_buff0_thd1~0_48)) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_9|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_9|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_8|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_48, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 04:59:36,462 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L752-->L752-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-935486965 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite25_Out-935486965| ~y$mem_tmp~0_In-935486965)) (and .cse0 (= ~y~0_In-935486965 |P0Thread1of1ForFork1_#t~ite25_Out-935486965|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-935486965, ~y$flush_delayed~0=~y$flush_delayed~0_In-935486965, ~y~0=~y~0_In-935486965} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-935486965, P0Thread1of1ForFork1_#t~ite25=|P0Thread1of1ForFork1_#t~ite25_Out-935486965|, ~y$flush_delayed~0=~y$flush_delayed~0_In-935486965, ~y~0=~y~0_In-935486965} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25] because there is no mapped edge [2019-12-27 04:59:36,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-941503622 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite54_Out-941503622| ~y~0_In-941503622) .cse0) (and (= ~y$mem_tmp~0_In-941503622 |P1Thread1of1ForFork0_#t~ite54_Out-941503622|) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-941503622, ~y$flush_delayed~0=~y$flush_delayed~0_In-941503622, ~y~0=~y~0_In-941503622} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-941503622, P1Thread1of1ForFork0_#t~ite54=|P1Thread1of1ForFork0_#t~ite54_Out-941503622|, ~y$flush_delayed~0=~y$flush_delayed~0_In-941503622, ~y~0=~y~0_In-941503622} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite54] because there is no mapped edge [2019-12-27 04:59:36,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L760-->L760-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-330843183 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-330843183 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite28_Out-330843183| ~y$w_buff0_used~0_In-330843183)) (and (not .cse0) (= |P0Thread1of1ForFork1_#t~ite28_Out-330843183| 0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-330843183, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-330843183} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-330843183, P0Thread1of1ForFork1_#t~ite28=|P0Thread1of1ForFork1_#t~ite28_Out-330843183|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-330843183} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 04:59:36,479 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1020] [1020] L761-->L761-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-479913452 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd1~0_In-479913452 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-479913452 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-479913452 256) 0))) (or (and (= 0 |P0Thread1of1ForFork1_#t~ite29_Out-479913452|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |P0Thread1of1ForFork1_#t~ite29_Out-479913452| ~y$w_buff1_used~0_In-479913452)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-479913452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-479913452, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-479913452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-479913452} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-479913452, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-479913452, P0Thread1of1ForFork1_#t~ite29=|P0Thread1of1ForFork1_#t~ite29_Out-479913452|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-479913452, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-479913452} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite29] because there is no mapped edge [2019-12-27 04:59:36,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1019] [1019] L762-->L763: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1430399060 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In1430399060 256) 0))) (or (and (not .cse0) (not .cse1) (= ~y$r_buff0_thd1~0_Out1430399060 0)) (and (= ~y$r_buff0_thd1~0_Out1430399060 ~y$r_buff0_thd1~0_In1430399060) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1430399060, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1430399060} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1430399060, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out1430399060, P0Thread1of1ForFork1_#t~ite30=|P0Thread1of1ForFork1_#t~ite30_Out1430399060|} AuxVars[] AssignedVars[~y$r_buff0_thd1~0, P0Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 04:59:36,480 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L763-->L763-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1520279536 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1520279536 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd1~0_In-1520279536 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1520279536 256)))) (or (and (= |P0Thread1of1ForFork1_#t~ite31_Out-1520279536| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork1_#t~ite31_Out-1520279536| ~y$r_buff1_thd1~0_In-1520279536) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1520279536, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1520279536, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1520279536, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1520279536} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1520279536, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1520279536, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1520279536, P0Thread1of1ForFork1_#t~ite31=|P0Thread1of1ForFork1_#t~ite31_Out-1520279536|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1520279536} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 04:59:36,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In1924368991 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In1924368991 256)))) (or (and (= ~y$w_buff1~0_In1924368991 |P1Thread1of1ForFork0_#t~ite55_Out1924368991|) (not .cse0) (not .cse1)) (and (= ~y~0_In1924368991 |P1Thread1of1ForFork0_#t~ite55_Out1924368991|) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1924368991, ~y$w_buff1~0=~y$w_buff1~0_In1924368991, ~y~0=~y~0_In1924368991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1924368991} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1924368991, ~y$w_buff1~0=~y$w_buff1~0_In1924368991, P1Thread1of1ForFork0_#t~ite55=|P1Thread1of1ForFork0_#t~ite55_Out1924368991|, ~y~0=~y~0_In1924368991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1924368991} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite55] because there is no mapped edge [2019-12-27 04:59:36,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L795-4-->L796: Formula: (= v_~y~0_27 |v_P1Thread1of1ForFork0_#t~ite55_8|) InVars {P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_8|} OutVars{P1Thread1of1ForFork0_#t~ite56=|v_P1Thread1of1ForFork0_#t~ite56_7|, P1Thread1of1ForFork0_#t~ite55=|v_P1Thread1of1ForFork0_#t~ite55_7|, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite56, P1Thread1of1ForFork0_#t~ite55, ~y~0] because there is no mapped edge [2019-12-27 04:59:36,482 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [995] [995] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-681886150 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-681886150 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite57_Out-681886150| ~y$w_buff0_used~0_In-681886150) (or .cse0 .cse1)) (and (not .cse1) (= |P1Thread1of1ForFork0_#t~ite57_Out-681886150| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-681886150, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-681886150} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-681886150, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-681886150, P1Thread1of1ForFork0_#t~ite57=|P1Thread1of1ForFork0_#t~ite57_Out-681886150|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite57] because there is no mapped edge [2019-12-27 04:59:36,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1011] [1011] L797-->L797-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1267856839 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1267856839 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1267856839 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1267856839 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite58_Out-1267856839|)) (and (= ~y$w_buff1_used~0_In-1267856839 |P1Thread1of1ForFork0_#t~ite58_Out-1267856839|) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1267856839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1267856839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1267856839, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1267856839} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1267856839, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1267856839, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1267856839, P1Thread1of1ForFork0_#t~ite58=|P1Thread1of1ForFork0_#t~ite58_Out-1267856839|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1267856839} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite58] because there is no mapped edge [2019-12-27 04:59:36,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1010] [1010] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2146583356 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2146583356 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite59_Out2146583356| 0)) (and (= ~y$r_buff0_thd2~0_In2146583356 |P1Thread1of1ForFork0_#t~ite59_Out2146583356|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2146583356, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2146583356} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2146583356, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2146583356, P1Thread1of1ForFork0_#t~ite59=|P1Thread1of1ForFork0_#t~ite59_Out2146583356|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite59] because there is no mapped edge [2019-12-27 04:59:36,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] L763-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~y$r_buff1_thd1~0_36 |v_P0Thread1of1ForFork1_#t~ite31_8|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_8|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_36, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork1_#t~ite31=|v_P0Thread1of1ForFork1_#t~ite31_7|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-27 04:59:36,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L799-->L799-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2110208408 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-2110208408 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-2110208408 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-2110208408 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite60_Out-2110208408| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite60_Out-2110208408| ~y$r_buff1_thd2~0_In-2110208408)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2110208408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2110208408, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2110208408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2110208408} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2110208408, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2110208408, P1Thread1of1ForFork0_#t~ite60=|P1Thread1of1ForFork0_#t~ite60_Out-2110208408|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2110208408, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2110208408} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite60] because there is no mapped edge [2019-12-27 04:59:36,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L799-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y$r_buff1_thd2~0_34 |v_P1Thread1of1ForFork0_#t~ite60_8|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_34, P1Thread1of1ForFork0_#t~ite60=|v_P1Thread1of1ForFork0_#t~ite60_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 04:59:36,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [986] [986] L820-1-->L826: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet62, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 04:59:36,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L826-2-->L826-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite64_Out1568309987| |ULTIMATE.start_main_#t~ite63_Out1568309987|)) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1568309987 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1568309987 256) 0))) (or (and (not .cse0) (= ~y$w_buff1~0_In1568309987 |ULTIMATE.start_main_#t~ite63_Out1568309987|) .cse1 (not .cse2)) (and (= ~y~0_In1568309987 |ULTIMATE.start_main_#t~ite63_Out1568309987|) .cse1 (or .cse2 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1568309987, ~y~0=~y~0_In1568309987, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1568309987, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568309987} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out1568309987|, ~y$w_buff1~0=~y$w_buff1~0_In1568309987, ~y~0=~y~0_In1568309987, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1568309987, ULTIMATE.start_main_#t~ite64=|ULTIMATE.start_main_#t~ite64_Out1568309987|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1568309987} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-27 04:59:36,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1017] [1017] L827-->L827-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In2009506778 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In2009506778 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite65_Out2009506778| 0)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In2009506778 |ULTIMATE.start_main_#t~ite65_Out2009506778|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2009506778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2009506778} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2009506778, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2009506778, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out2009506778|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-27 04:59:36,489 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L828-->L828-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-1780449320 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1780449320 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1780449320 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-1780449320 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite66_Out-1780449320| ~y$w_buff1_used~0_In-1780449320)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |ULTIMATE.start_main_#t~ite66_Out-1780449320|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1780449320, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1780449320, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1780449320, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1780449320} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1780449320, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1780449320, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-1780449320|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1780449320, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1780449320} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-27 04:59:36,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1007] [1007] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1547620109 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1547620109 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd0~0_In1547620109 |ULTIMATE.start_main_#t~ite67_Out1547620109|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite67_Out1547620109| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1547620109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547620109} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1547620109, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1547620109, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out1547620109|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-27 04:59:36,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1152405760 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1152405760 256) 0)) (.cse3 (= (mod ~y$w_buff0_used~0_In1152405760 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In1152405760 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite68_Out1152405760|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~y$r_buff1_thd0~0_In1152405760 |ULTIMATE.start_main_#t~ite68_Out1152405760|) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1152405760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1152405760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1152405760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1152405760} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1152405760, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1152405760, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out1152405760|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1152405760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1152405760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-27 04:59:36,491 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1055] [1055] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EBX~0_8 0) (= v_~__unbuffered_p0_EAX~0_9 1) (= 0 v_~__unbuffered_p1_EBX~0_9) (= |v_ULTIMATE.start_main_#t~ite68_15| v_~y$r_buff1_thd0~0_20)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_15|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_8, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_20, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite68, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 04:59:36,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:59:36 BasicIcfg [2019-12-27 04:59:36,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:59:36,654 INFO L168 Benchmark]: Toolchain (without parser) took 20533.53 ms. Allocated memory was 134.7 MB in the beginning and 850.4 MB in the end (delta: 715.7 MB). Free memory was 98.0 MB in the beginning and 464.6 MB in the end (delta: -366.6 MB). Peak memory consumption was 349.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:36,655 INFO L168 Benchmark]: CDTParser took 1.53 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 04:59:36,660 INFO L168 Benchmark]: CACSL2BoogieTranslator took 793.54 ms. Allocated memory was 134.7 MB in the beginning and 200.8 MB in the end (delta: 66.1 MB). Free memory was 97.6 MB in the beginning and 153.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:36,660 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.60 ms. Allocated memory is still 200.8 MB. Free memory was 153.4 MB in the beginning and 150.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:36,661 INFO L168 Benchmark]: Boogie Preprocessor took 80.82 ms. Allocated memory is still 200.8 MB. Free memory was 150.4 MB in the beginning and 147.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:36,661 INFO L168 Benchmark]: RCFGBuilder took 963.77 ms. Allocated memory is still 200.8 MB. Free memory was 147.4 MB in the beginning and 90.9 MB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:36,662 INFO L168 Benchmark]: TraceAbstraction took 18589.79 ms. Allocated memory was 200.8 MB in the beginning and 850.4 MB in the end (delta: 649.6 MB). Free memory was 90.9 MB in the beginning and 464.6 MB in the end (delta: -373.7 MB). Peak memory consumption was 275.9 MB. Max. memory is 7.1 GB. [2019-12-27 04:59:36,671 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.53 ms. Allocated memory is still 134.7 MB. Free memory was 117.9 MB in the beginning and 117.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 793.54 ms. Allocated memory was 134.7 MB in the beginning and 200.8 MB in the end (delta: 66.1 MB). Free memory was 97.6 MB in the beginning and 153.4 MB in the end (delta: -55.8 MB). Peak memory consumption was 24.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 98.60 ms. Allocated memory is still 200.8 MB. Free memory was 153.4 MB in the beginning and 150.4 MB in the end (delta: 3.1 MB). Peak memory consumption was 3.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 80.82 ms. Allocated memory is still 200.8 MB. Free memory was 150.4 MB in the beginning and 147.4 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 963.77 ms. Allocated memory is still 200.8 MB. Free memory was 147.4 MB in the beginning and 90.9 MB in the end (delta: 56.5 MB). Peak memory consumption was 56.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 18589.79 ms. Allocated memory was 200.8 MB in the beginning and 850.4 MB in the end (delta: 649.6 MB). Free memory was 90.9 MB in the beginning and 464.6 MB in the end (delta: -373.7 MB). Peak memory consumption was 275.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 191 ProgramPointsBefore, 116 ProgramPointsAfterwards, 246 TransitionsBefore, 141 TransitionsAfterwards, 27428 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 26 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 53 ConcurrentYvCompositions, 33 ChoiceCompositions, 9313 VarBasedMoverChecksPositive, 294 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 156567 CheckedPairsTotal, 110 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t6, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, 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] [L729] 1 y$w_buff1 = y$w_buff0 [L730] 1 y$w_buff0 = 1 [L731] 1 y$w_buff1_used = y$w_buff0_used [L732] 1 y$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t7, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L745] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L746] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L746] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L747] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L747] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L748] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L750] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L751] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 1 y = y$flush_delayed ? y$mem_tmp : y [L753] 1 y$flush_delayed = (_Bool)0 [L756] 1 __unbuffered_p0_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 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_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=6, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 x = 1 [L776] 2 __unbuffered_p1_EAX = x [L779] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L780] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L781] 2 y$flush_delayed = weak$$choice2 [L782] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L784] 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_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 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)) [L785] 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_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 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)) [L786] 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_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 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)) [L787] 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_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L787] 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)) [L788] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L789] 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_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L789] 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)) [L790] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 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) [L760] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L761] 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 [L791] 2 y = y$flush_delayed ? y$mem_tmp : y [L792] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 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_p0_EAX=1, __unbuffered_p0_EBX=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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L797] 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 [L798] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L826] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] 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 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 185 locations, 2 error locations. Result: UNSAFE, OverallTime: 18.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 5.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4151 SDtfs, 3659 SDslu, 9672 SDs, 0 SdLazy, 2985 SolverSat, 153 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31650occurred 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.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 15666 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 809 NumberOfCodeBlocks, 809 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 721 ConstructedInterpolants, 0 QuantifiedInterpolants, 128445 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...